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.
Please sign up or login with your details
Become a DeepAI PRO
Pay as you go
Out of credits