The harmonious coloring problem is NP-complete for interval and permutation graphs.
Katerina AsdreKyriaki IoannidouStavros D. NikolopoulosPublished in: Discret. Appl. Math. (2007)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- np hard
- randomly generated
- undirected graph
- connected graphs
- constraint satisfaction problems
- graph matching
- pspace complete
- satisfiability problem
- computational complexity
- graph theory
- graph theoretic
- conjunctive queries
- weighted graph
- graph mining
- directed graph
- graph clustering
- interval data
- lower bound
- graph structure
- spanning tree
- complex structures
- bipartite graph
- structured data
- graphical models
- series parallel
- np complete problems
- bayesian networks