From Daan
MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) |
||
| Line 4: | Line 4: | ||
Here is our [http://heuristieken.nl/resources/(2020)Sleegers&VandenBerg-PPAforhardHamiltoniangraphs.pdf paper]. | Here is our [http://heuristieken.nl/resources/(2020)Sleegers&VandenBerg-PPAforhardHamiltoniangraphs.pdf paper]. | ||
| + | |||
| + | |||
| + | |||
| + | ==Errata== | ||
| + | |||
| + | The title of the paper is somewhat misleading; we're actually no looking for hard Hamiltonian graphs, but hard Hamiltonian problem instances, and the result of that are actually non-Hamiltonian graphs only. | ||
Revision as of 21:08, 13 May 2020
Paper
Here is our paper.
Errata
The title of the paper is somewhat misleading; we're actually no looking for hard Hamiltonian graphs, but hard Hamiltonian problem instances, and the result of that are actually non-Hamiltonian graphs only.