Finding Hamiltonian Cycles: Algorithms, Graphs and Performance

Basil Vandegriend Masters Thesis February 1998.

Postscript available here

Source Code for HC algorithms here

Abstract

My Master's thesis "Finding Hamiltonian Cycles: Algorithms, Graphs and Performance" deals with the Hamiltonian cycle problem, an NP-C problem in graph theory. The problem consists of finding a tour (or cycle) that visits all the vertices once and returns to the starting vertex. I have investigated several related issues: