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

12/04/2020

∙

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

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

Minimum Cut in O(mlog^2 n) Time

Solving Random Parity Games in Polynomial Time

Asymptotic performance of the Grimmett-McDiarmid heuristic

Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting

On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

Bond Percolation in Small-World Graphs with Power-Law Distribution

Fast algorithms for solving the Hamilton Cycle problem with high probability

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

Related Research

Minimum Cut in O(mlog^2 n) Time

Solving Random Parity Games in Polynomial Time

Asymptotic performance of the Grimmett-McDiarmid heuristic

Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting

On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

Bond Percolation in Small-World Graphs with Power-Law Distribution

Fast algorithms for solving the Hamilton Cycle problem with high probability