From Daan
Jump to: navigation, search
(Created page with " The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here]. Here is the [https://hamiltoncycle.gijsvanhorn.nl/hamiltoniancycled...")
 
(Paper)
(15 intermediate revisions by the same user not shown)
Line 1: Line 1:
 +
 +
==Paper==
 +
 +
Here is our [http://heuristieken.nl/resources/VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances.pdf 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 [https://hamiltoncycle.gijsvanhorn.nl/ here].
 
The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here].
  
  
Here is the [https://hamiltoncycle.gijsvanhorn.nl/hamiltoniancycledata data from the graphs].
 
  
 +
==Source Data for Interactive Graphs==
 +
 +
Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here.
 +
 +
 +
 +
==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.