From Daan
Jump to: navigation, search
(Paper)
(10 intermediate revisions by the same user not shown)
Line 1: Line 1:
  
 +
==Paper==
  
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.
+
Here is our [http://heuristieken.nl/resources/VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances.pdf paper].
  
  
==Interative Graphs==
+
'''Corrections, additions & developments:'''
  
The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here].
 
  
 +
CORRECTION: I misspelled the name of Edward Reingold as "Rheingold", possibly being confused by the Wagner opera.
  
== Source Data for Interative Graphs==
+
==Interactive Graphs==
  
Cheeseman's algorithm on 16 nodes graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-results.dsv]
+
The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ 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]
+
==Source Data for Interactive Graphs==
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]
+
Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here.
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]
 
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 [http://heuristieken.nl/resources/VanHornetal(2018)-sourcecode.zip source code] of the algorithms.

Revision as of 20:13, 25 December 2018

Paper

Here is our paper.


Corrections, additions & developments:


CORRECTION: I misspelled the name of Edward Reingold as "Rheingold", possibly being confused by the Wagner opera.

Interactive Graphs

The interactive graphs for Hamiltonian cycles can be found here.


Source Data for Interactive Graphs

Download our results here.


Source Code for the Algorithms

And here is the source code of the algorithms.