From Daan

MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) |
||

Line 1: | Line 1: | ||

+ | ==Paper== | ||

− | + | Here is our [http://heuristieken.nl/resources/VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances.pdf paper]. | |

+ | |||

+ | |||

+ | VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances | ||

==Interative Graphs== | ==Interative Graphs== | ||

Line 10: | Line 14: | ||

− | == Source Data for Interative Graphs== | + | ==Source Data for Interative 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 16: | Line 20: | ||

− | == 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 15:31, 26 November 2018

## Contents

## Paper

Here is our paper.

VanHornetal(2018)-aPredictiveDataAnalyticfortheHardnessofHamiltonianCycleInstances

## Interative Graphs

The interactive graphs for Hamiltonian cycles can be found here.

## Source Data for Interative Graphs

Download our results here.

## Source Code for the algorithms

And here is the source code of the algorithms.