AI master student Joeri Sleegers publishes work on the Hamiltonian cycle problem
13 May 2020
A direct extract from Joeri Sleegers' master's thesis, a paper entitled "Propagation & Hard Hamiltonian Graphs" was published on the EvoSTAR-conference, which was held completely online in April 2020.
In the study, hard Hamiltonian cycle problem instances are created with evolutionary algorithms such as the Plant Propagation Algorithm. A remarkable result is that these graphs are found far away from the Komlós-Szemerédi bound, where the hardest graphs are traditionally found.
Hamburger
