The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No.

Joeri Sleegers Daan van den Berg

Published in: SN Comput. Sci. (2022)

Keyphrases

hamiltonian cycle
phase transition
randomly generated
traveling salesman problem
graph coloring
satisfiability problem
np complete
constraint satisfaction
combinatorial problems
search algorithm
sat problem
search procedures