On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path.

Olivier Hudry Antoine Lobstein

Published in: CoRR (2022)

Keyphrases

hamiltonian cycle
traveling salesman problem
graph coloring
phase transition
computational complexity
upper bound
simulated annealing
decision problems
space complexity