The Planar Hamiltonian Circuit Problem is NP-Complete.
M. R. GareyDavid S. JohnsonRobert Endre TarjanPublished in: SIAM J. Comput. (1976)
Keyphrases
- np complete
- gallium arsenide
- graph coloring
- np complete problems
- randomly generated
- computational complexity
- np hard
- constraint satisfaction problems
- satisfiability problem
- high speed
- pspace complete
- phase transition
- circuit design
- digital circuits
- analog circuits
- conjunctive queries
- planar surfaces
- parallel manipulator
- bounded treewidth
- ground plane
- constraint satisfaction
- polynomial time complexity
- sat problem
- data complexity
- single phase
- analog vlsi
- duty cycle
- low cost