Finding hamilton cycles in sparse random graphs

We describe a polynomial time ( O( n 3 log n)) algorithm which has a high probability of finding hamilton cycles in two classes of random graph which have constant average degree: the m-out model and the random regular graph model. We also show how the algorithm can be used to find a large cycle in...

Full description

Saved in:
Bibliographic Details
Published inJournal of combinatorial theory. Series B Vol. 44; no. 2; pp. 230 - 250
Main Author Frieze, A.M
Format Journal Article
LanguageEnglish
Published Duluth, MN Elsevier Inc 01.04.1988
Academic Press
Subjects
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Graph theory
Hamiltonian cycle
Search algorithm
Random graph
Polynomial time
Online AccessGet full text

Cover

More Information
Summary:We describe a polynomial time ( O( n 3 log n)) algorithm which has a high probability of finding hamilton cycles in two classes of random graph which have constant average degree: the m-out model and the random regular graph model. We also show how the algorithm can be used to find a large cycle in a sparse random graph.
ISSN:0095-8956
1096-0902
DOI:10.1016/0095-8956(88)90089-5