On the minimum and maximum selective graph coloring problems in some graph classes.
Marc DemangeTínaz EkimBernard RiesPublished in: Discret. Appl. Math. (2016)
Keyphrases
- graph coloring problems
- spanning tree
- constraint satisfaction problems
- graph representation
- directed graph
- random walk
- structured data
- maximum distance
- graph structure
- graph theoretic
- equivalence classes
- weighted graph
- bipartite graph
- graph model
- minimum cut
- graph clustering
- minimum energy
- connected dominating set
- dependency graph
- min sum
- search algorithm
- graph search
- graph partitioning
- graph theory
- connected components
- class labels
- shortest path
- pairwise