An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

Alan Frieze; Simi Haber

doi:10.1002/rsa.20542

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

Alan Frieze, Simi Haber

Carnegie Mellon University

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

6 Scopus citations

Abstract

We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G=G_n,mδ≥3. In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in O(n^1+o(1)) time and succeeds w.h.p.

Original language	English
Pages (from-to)	73-98
Number of pages	26
Journal	Random Structures and Algorithms
Volume	47
Issue number	1
DOIs	https://doi.org/10.1002/rsa.20542
State	Published - 1 Aug 2015
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2014 Wiley Periodicals, Inc.

Funding

Funders	Funder number
National Science Foundation	CCF2013110

Keywords

Fast algorithm
Hamilton cycles
Random graphs

Access to Document

10.1002/rsa.20542

Cite this

@article{8383959c6fd44b52bebca4f2b39dde74,

title = "An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three",

abstract = "We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G=Gn,mδ≥3. In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in O(n1+o(1)) time and succeeds w.h.p.",

keywords = "Fast algorithm, Hamilton cycles, Random graphs",

author = "Alan Frieze and Simi Haber",

note = "Publisher Copyright: {\textcopyright} 2014 Wiley Periodicals, Inc.",

year = "2015",

month = aug,

day = "1",

doi = "10.1002/rsa.20542",

language = "אנגלית",

volume = "47",

pages = "73--98",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "1",

}

TY - JOUR

T1 - An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

AU - Frieze, Alan

AU - Haber, Simi

PY - 2015/8/1

Y1 - 2015/8/1

N2 - We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G=Gn,mδ≥3. In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in O(n1+o(1)) time and succeeds w.h.p.

AB - We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G=Gn,mδ≥3. In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in O(n1+o(1)) time and succeeds w.h.p.

KW - Fast algorithm

KW - Hamilton cycles

KW - Random graphs

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

U2 - 10.1002/rsa.20542

DO - 10.1002/rsa.20542

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

AN - SCOPUS:84932193637

SN - 1042-9832

VL - 47

SP - 73

EP - 98

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 1

ER -

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this