This is a redirection page associated with a replication study of Van Horn et al. We're currently finishing the paper.
Interative Graphs
The interactive graphs for Hamiltonian cycles can be found here.
Source Data for Interative Graphs
Cheeseman's algorithm on 16 nodes graphs: [1] Average and median computational costs: [2]
Cheeseman's algorithm on 24 node graphs:"https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Cheeseman-results.dsv" Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Cheeseman-derived-results.dsv"
Van Horn's algorithm on 16 node graphs: [3] Average and median computational costs: [4]
Van Horn's algorithm on 24 node graphs: [5] Average and median computational costs: [6]
Vandegriend and Culberson's algorithm on 16 nodes: [7] Average and median computational costs: [8]
Vandegriend and Culberson's algorithm on 24 nodes [9] Average and median computational costs [10]
Source Code for the algortihms
And here is the source code of the algorithms.