Frieze, Alan Haber, Simi An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three <p>We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph . In this model <em>G</em> is drawn uniformly from graphs with vertex set [<em>n</em>], <em>m</em> edges and minimum degree at least three. We focus on the case where <em>m</em> = <em>cn</em> for constant <em>c</em>. If <em>c</em> is sufficiently large then our algorithm runs in time and succeeds w.h.p.</p> Hamilton cycles;fast algorithm;random graphs 2013-12-20
    https://kilthub.cmu.edu/articles/journal_contribution/An_almost_linear_time_algorithm_for_finding_Hamilton_cycles_in_sparse_random_graphs_with_minimum_degree_at_least_three/6476768
10.1184/R1/6476768.v1