Backtracking (the) Algorithms on the Hamiltonian Cycle Problem

Joeri Sleegers, Daan van den Berg

Even though the Hamiltonian cycle problem is NP-complete, many of its problem instances aren't. In fact, almost all the hard instances reside in one area: near the Komlós-Szemerédi…