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

12/04/2020
āˆ™
by   Rajko Nenadov, et al.
āˆ™
0
āˆ™

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset