NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs

B. S. Panda Dinabandhu Pradhan

Published in: CoRR (2008)

Keyphrases

hamiltonian cycle
traveling salesman problem
phase transition
graph coloring
shortest path
optimization problems
scheduling problem
upper bound
combinatorial optimization