13 May 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