Login / Signup

The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two.

Ján Plesník
Published in: Inf. Process. Lett. (1979)
Keyphrases
  • hamiltonian cycle
  • traveling salesman problem
  • phase transition
  • upper bound
  • graph coloring
  • lower bound
  • random walk
  • multistage
  • branch and bound