From Daan
Jump to: navigation, search
(→‎Paper)
(2 intermediate revisions by the same user not shown)
Line 5: Line 5:
  
  
 +
'''Corrections, additions & developments:'''
  
−
VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances
 
  
−
==Interative Graphs==
+
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].
Line 14: Line 16:
  
  
−
==Source Data for Interative Graphs==
+
==Source Data for Interactive Graphs==
  
 
Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here.
 
Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here.
Line 20: Line 22:
  
  
−
==Source Code for the algorithms==
+
==Source Code for the Algorithms==
  
 
And here is the [http://heuristieken.nl/resources/VanHornetal(2018)-sourcecode.zip 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 17: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.

Retrieved from "http://heuristieken.nl/wiki/index.php?title=A_Predictive_Data_Analytic_for_the_Hardness_of_Hamiltonian_Cycle_Problem_Instances&oldid=2742"