Finding a Hamilton cycle fast on average using rotations and extensions

Yahav Alon; Michael Krivelevich

doi:10.1002/rsa.20918

Finding a Hamilton cycle fast on average using rotations and extensions

Yahav Alon^*, Michael Krivelevich

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	32-46
Number of pages	15
Journal	Random Structures and Algorithms
Volume	57
Issue number	1
DOIs	https://doi.org/10.1002/rsa.20918
State	Published - 1 Aug 2020

Keywords

Hamilton cycles
expected polynomial time algorithms
random graphs

Access to Document

10.1002/rsa.20918

Cite this

@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",

}

TY - JOUR

T1 - Finding a Hamilton cycle fast on average using rotations and extensions

AU - Alon, Yahav

AU - Krivelevich, Michael

N1 - Publisher Copyright: © Wiley Periodicals, Inc.

PY - 2020/8/1

Y1 - 2020/8/1

N2 - 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.

AB - 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.

KW - Hamilton cycles

KW - expected polynomial time algorithms

KW - random graphs

UR - http://www.scopus.com/inward/record.url?scp=85082728181&partnerID=8YFLogxK

U2 - 10.1002/rsa.20918

DO - 10.1002/rsa.20918

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85082728181

SN - 1042-9832

VL - 57

SP - 32

EP - 46

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 1

ER -

Finding a Hamilton cycle fast on average using rotations and extensions

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this