For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.

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

Joeri Sleegers
Joeri Sleegers