An O(n) time algorithm for finding Hamilton cycles with high probability

12/04/2020

∙

by   Rajko Nenadov, et al.

∙

0

∙

share

We design a randomized algorithm that finds a Hamilton cycle in 𝒪(n) time with high probability in a random graph G_n,p with edge probability p≥ C log n / n. This closes a gap left open in a seminal paper by Angluin and Valiant from 1979.