A comparison of methods for finding Hamiltonian circuits in graphs PublicDeposited

Descriptions

This paper compares three classes of algorithms for finding
Hamiltonian circuits in graphs. Two of the classes are exhaustive
search procedures and this study finds them to have an exponential
dependence on the size of the graph. The third class of algorithms,
based on Warnsdorff's rule, is found to be less dependent on the
size of the graph but restricted to finding only a single circuit.
The effect of density and regularity of the characteristic performance
of the algorithms is shown to be minimal.