@article{26af6c6cc886435bb269399b2c03c494,
title = "Finding a Hamilton cycle fast on average using rotations and extensions",
abstract = "We present an algorithm CRE, which either finds a Hamilton cycle in a graph G or determines that there is no such cycle in the graph. The algorithm's expected running time over input distribution G∼G(n,p) is (1+o(1))n/p, the optimal possible expected time, for (Formula presented.). This improves upon previous results on this problem due to Gurevich and Shelah, and to Thomason.",
keywords = "Hamilton cycles, expected polynomial time algorithms, random graphs",
author = "Yahav Alon and Michael Krivelevich",
note = "Publisher Copyright: {\textcopyright} Wiley Periodicals, Inc.",
year = "2020",
month = aug,
day = "1",
doi = "10.1002/rsa.20918",
language = "אנגלית",
volume = "57",
pages = "32--46",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "1",
}