Hamiltonian index is NP-complete.
Zdenek RyjácekGerhard J. WoegingerLiming XiongPublished in: Discret. Appl. Math. (2011)
Keyphrases
- np complete
- randomly generated
- computational complexity
- satisfiability problem
- np hard
- constraint satisfaction problems
- pspace complete
- index structure
- conjunctive queries
- data complexity
- bounded treewidth
- sat problem
- graph coloring
- polynomially solvable
- polynomial time complexity
- data integration
- information systems
- conp complete