On the complexity of the selective graph coloring problem in some special classes of graphs.
Marc DemangeJérôme MonnotPetrica C. PopBernard RiesPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- tractable cases
- complexity measures
- graph matching
- algebraic structures
- graph theoretic
- computational cost
- polynomial time complexity
- space complexity
- genetic algorithm
- undirected graph
- intrinsic complexity
- bounded treewidth
- random graphs
- graph clustering
- complexity analysis
- graph mining
- decision problems
- class labels
- query language
- search algorithm
- image segmentation