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...