Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2021.60
URN: urn:nbn:de:0030-drops-135997
URL: https://drops.dagstuhl.de/opus/volltexte/2021/13599/
Nenadov, Rajko ; Steger, Angelika ; Su, Pascal
An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{nenadov_et_al:LIPIcs.ITCS.2021.60,
author = {Rajko Nenadov and Angelika Steger and Pascal Su},
title = {{An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {60:1--60:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {James R. Lee},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13599},
URN = {urn:nbn:de:0030-drops-135997},
doi = {10.4230/LIPIcs.ITCS.2021.60},
annote = {Keywords: Random Graphs, Hamilton Cycle, Perfect Matching, Linear Time, Sublinear Algorithm, Random Walk, Coupon Collector}
}
| Keywords: | Random Graphs, Hamilton Cycle, Perfect Matching, Linear Time, Sublinear Algorithm, Random Walk, Coupon Collector | |
| Seminar: | 12th Innovations in Theoretical Computer Science Conference (ITCS 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 04.02.2021 |
