Finding hidden hamiltonian cycles
Andrei Broder, ALAN M. FRIEZE, Eli Shamir · Random Structures and Algorithms · 1994
Abstract 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.