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

by   Rajko Nenadov, et al.

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.


page 1

page 2

page 3

page 4

∙ 11/04/2019

Minimum Cut in O(mlog^2 n) Time

We give a randomized algorithm that finds a minimum cut in an undirected...
∙ 07/16/2020

Solving Random Parity Games in Polynomial Time

We consider the problem of solving random parity games. We prove that pa...
∙ 12/10/2019

Asymptotic performance of the Grimmett-McDiarmid heuristic

Grimmett and McDiarmid suggested a simple heuristic for finding stable s...
∙ 09/13/2016

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

We derive a new proof to show that the incremental resparsification algo...
∙ 10/24/2018

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

We tackle the problem of the randomized generation of slowly synchronizi...
∙ 05/18/2022

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

Full-bond percolation with parameter p is the process in which, given a ...
∙ 11/29/2021

Fast algorithms for solving the Hamilton Cycle problem with high probability

We study the Hamilton cycle problem with input a random graph G=G(n,p) i...

Please sign up or login with your details

Forgot password? Click here to reset