Backtracking (the) Algorithms on the Hamiltonian Cycle Problem

07/01/2021
by   Joeri Sleegers, et al.
0

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 bound, of 1/2 v· ln(v) + 1/2 v· ln( ln(v)) edges, where randomly generated graphs have an approximate 50% chance of being Hamiltonian. If the number of edges is either much higher or much lower, the problem is not hard – most backtracking algorithms decide such instances in (near) polynomial time. Recently however, targeted search efforts have identified very hard Hamiltonian cycle problem instances very far away from the Komlós-Szemerédi bound. In that study, the used backtracking algorithm was Vandegriend-Culberson's, which was supposedly the most efficient of all Hamiltonian backtracking algorithms. In this paper, we make a unified large scale quantitative comparison for the best known backtracking algorithms described between 1877 and 2016. We confirm the suspicion that the Komlós-Szemerédi bound is a hard area for all backtracking algorithms, but also that Vandegriend-Culberson is indeed the most efficient algorithm, when expressed in consumed computing time. When measured in recursive effectiveness however, the algorithm by Frank Rubin, almost half a century old, performs best. In a more general algorithmic assessment, we conjecture that edge pruning and non-Hamiltonicity checks might be largely responsible for these recursive savings. When expressed in system time however, denser problem instances require much more time per recursion. This is most likely due to the costliness of the extra search pruning procedures, which are relatively elaborate. We supply large amounts of experimental data, and a unified single-program implementation for all six algorithms. All data and algorithmic source code is made public for further use by our colleagues.

READ FULL TEXT

page 1

page 3

page 4

page 7

page 8

page 9

research
11/25/2017

Hamiltonian Path in Split Graphs- a Dichotomy

In this paper, we investigate Hamiltonian path problem in the context of...
research
07/10/2021

Hamiltonicity: Variants and Generalization in P_5-free Chordal Bipartite graphs

A bipartite graph is chordal bipartite if every cycle of length at least...
research
09/17/2023

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number

A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, ...
research
05/27/2011

The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem

Using an improved backtrack algorithm with sophisticated pruning techniq...
research
02/27/2019

Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem

We present a polynomial complexity, deterministic, heuristic for solving...
research
02/27/2019

FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem

The FHCP Challenge Set, comprising of 1001 instances of Hamiltonian cycl...
research
02/27/2019

A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem

We consider a direct conversion of the, classical, set splitting problem...

Please sign up or login with your details

Forgot password? Click here to reset