The NPO-Completeness of the Longest Hamiltonian Cycle Problem.

Q. S. Wu Kun-Mao Chao Richard C. T. Lee

Published in: Inf. Process. Lett. (1998)

Keyphrases

hamiltonian cycle
traveling salesman problem
graph coloring
phase transition
special case
constraint satisfaction
combinatorial problems
machine learning
search algorithm
upper bound