|
|
| Line 7: |
Line 7: |
| | | | |
| | The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here]. | | The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here]. |
| | + | |
| | | | |
| | | | |
| | == Source Data for Interative Graphs== | | == Source Data for Interative Graphs== |
| | | | |
| − | Cheeseman's algorithm on 16 nodes graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-results.dsv]
| + | Download our [VanHornetal (2018) - results.xls results] here. |
| − | | |
| − | Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-derived-results.dsv]
| |
| − | | |
| − | | |
| − | 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: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Inverse-Cheeseman-results.dsv]
| |
| − | | |
| − | Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Inverse-Cheeseman-derived-results.dsv]
| |
| − | | |
| − | | |
| − | Van Horn's algorithm on 24 node graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Inverse-Cheeseman-results.dsv]
| |
| − | | |
| − | Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Inverse-Cheeseman-derived-results.dsv]
| |
| − | | |
| − | | |
| − | Vandegriend and Culberson's algorithm on 16 node graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Pruning-results.dsv]
| |
| − | | |
| − | Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Pruning-derived-results.dsv]
| |
| − | | |
| − | | |
| − | Vandegriend and Culberson's algorithm on 24 node graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Pruning-results.dsv]
| |
| | | | |
| − | Average and median computational costs [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Pruning-derived-results.dsv]
| |
| | | | |
| | | | |
Revision as of 12:21, 26 November 2018
This is a temporary redirection page associated with a replication study of Van Horn et al for review transparency. We're currently finishing the paper.
Interative Graphs
The interactive graphs for Hamiltonian cycles can be found here.
Source Data for Interative Graphs
Download our [VanHornetal (2018) - results.xls results] here.
Source Code for the algorithms
And here is the source code of the algorithms.