Finding a Hamilton cycle fast on average using rotations and extensions

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)32-46
Number of pages15
JournalRandom Structures and Algorithms
Volume57
Issue number1
DOIs
StatePublished - 1 Aug 2020

Keywords

  • Hamilton cycles
  • expected polynomial time algorithms
  • random graphs

Fingerprint

Dive into the research topics of 'Finding a Hamilton cycle fast on average using rotations and extensions'. Together they form a unique fingerprint.

Cite this