We present an algorithm CRE, which either finds a Hamilton cycle in a graph G or determines that there is no such cycle in the graph. The algorithm's expected running time over input distribution G∼G(n,p) is (1+o(1))n/p, the optimal possible expected time, for (Formula presented.). This improves upon previous results on this problem due to Gurevich and Shelah, and to Thomason.
|Number of pages||15|
|Journal||Random Structures and Algorithms|
|State||Published - 1 Aug 2020|
- Hamilton cycles
- expected polynomial time algorithms
- random graphs