A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2 n/3 ) ≈ 1.260 n and linear space. Our algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound. We can also count or list all Hamiltonian cycles in a degree three graph in time O(2 3n/8 ) ≈ 1.297 n . We also solve the traveling salesman problem in graphs of degree at most four, by randomized and deterministic algorithms with runtime O((27/4)doi:10.7155/jgaa.00137 fatcat:lfdy3hrroveyfehumr4nipbd7y