|Line 1:||Line 1:|
Revision as of 22:59, 5 September 2018
This is a redirection page associated with a replication study of Van Horn et al. We're currently finishing the paper.
The interactive graphs for Hamiltonian cycles can be found here.
Source Data for Interative Graphs
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"
Source Code for the algortihms
And here is the source code of the algorithms.