From Daan
Jump to: navigation, search
(→‎Paper)
(→‎Paper)
Line 11: Line 11:
  
  
−
ADDITION: On page 93: "2) when recursing, always prioritize a higher degree vertex over a lower degree vertex.". It should be understood 'a higher degree vertex' means 'a vertex which is not already in the path, that has the largest number of edges ''to unvisited vertices'''. In other words: the priority list of available vertices is determined and sorted during each recursion call.
+
ADDITION to page 93: "when recursing, always prioritize a higher degree vertex over a lower degree vertex.". It should be understood 'a higher degree vertex' means 'a vertex which is not already in the path, that has the largest number of edges ''to unvisited vertices'''. In other words: the priority list of available vertices is determined and sorted during each recursion call.
  
 
==Interactive Graphs==
 
==Interactive Graphs==

Revision as of 10:52, 15 June 2019

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.


ADDITION to page 93: "when recursing, always prioritize a higher degree vertex over a lower degree vertex.". It should be understood 'a higher degree vertex' means 'a vertex which is not already in the path, that has the largest number of edges to unvisited vertices'. In other words: the priority list of available vertices is determined and sorted during each recursion call.

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=2808"