TY - JOUR
T1 - Finding hidden hamiltonian cycles
AU - Broder, Andrei Z.
AU - Frieze, Alan M.
AU - Shamir, Eli
PY - 1994/7
Y1 - 1994/7
N2 - Consider a random graph G composed of a Hamiltonian cycle on n labeled vertices and dn random edges that “high” the cycle. Is it possible to unravel the structures, that is, to efficiently find a Himiltonian cycle in G? We describe an O(n3 log n)‐step algorithm A for this purpose, and prove that it succeeds almost surely. Part one of A properly covers the “trouble spots” of G by a collection of disjoint paths. (This is the hard part to analyze). Part two of A extends this cover to a full cycle by the rotation‐extension technique which is already classical for such problems. © 1994 John Wiley & Sons, Inc.
AB - Consider a random graph G composed of a Hamiltonian cycle on n labeled vertices and dn random edges that “high” the cycle. Is it possible to unravel the structures, that is, to efficiently find a Himiltonian cycle in G? We describe an O(n3 log n)‐step algorithm A for this purpose, and prove that it succeeds almost surely. Part one of A properly covers the “trouble spots” of G by a collection of disjoint paths. (This is the hard part to analyze). Part two of A extends this cover to a full cycle by the rotation‐extension technique which is already classical for such problems. © 1994 John Wiley & Sons, Inc.
UR - https://www.scopus.com/pages/publications/84990717242
U2 - 10.1002/rsa.3240050303
DO - 10.1002/rsa.3240050303
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84990717242
SN - 1042-9832
VL - 5
SP - 395
EP - 410
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 3
ER -