From Daan
Jump to: navigation, search
Line 14: Line 14:
 
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-derived-results.dsv]
 
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]
+
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]
 
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Cheeseman-derived-results.dsv]
  
Line 23: Line 23:
 
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Inverse-Cheeseman-derived-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 nodes: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Pruning-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]
 
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Pruning-derived-results.dsv]
  
Vandegriend and Culberson's algorithm on 24 nodes [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Pruning-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]
 
Average and median computational costs [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Pruning-derived-results.dsv]
  
  
== Source Code for the algortihms==
+
== Source Code for the algorithms==
  
 
And here is the [https://hamiltoncycle.gijsvanhorn.nl/sourcecode source code] of the algorithms.
 
And here is the [https://hamiltoncycle.gijsvanhorn.nl/sourcecode source code] of the algorithms.

Revision as of 00:06, 6 September 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

Cheeseman's algorithm on 16 nodes graphs: [1] Average and median computational costs: [2]

Cheeseman's algorithm on 24 node graphs: [3] Average and median computational costs: [4]

Van Horn's algorithm on 16 node graphs: [5] Average and median computational costs: [6]

Van Horn's algorithm on 24 node graphs: [7] Average and median computational costs: [8]

Vandegriend and Culberson's algorithm on 16 node graphs: [9] Average and median computational costs: [10]

Vandegriend and Culberson's algorithm on 24 node graphs: [11] Average and median computational costs [12]


Source Code for the algorithms

And here is the source code of the algorithms.