From Daan

MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) (→Paper) |
||

(12 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. | ||

− | |||

+ | 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 [https://hamiltoncycle.gijsvanhorn.nl/ here]. | |

− | |||

− | |||

− | |||

− | |||

− | |||

− | + | ==Source Data for Interactive Graphs== | |

− | |||

− | + | Download our [http://heuristieken.nl/resources/VanHornetal(2018)-results.xls results] here. | |

− | |||

− | |||

− | |||

− | == Source Code for the | + | ==Source Code for the Algorithms== |

− | And here is the [ | + | And here is the [http://heuristieken.nl/resources/VanHornetal(2018)-sourcecode.zip source code] of the algorithms. |

## Latest revision as of 13:53, 15 June 2019

## Contents

## 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.