On a simple randomized algorithm for finding a 2-factor in sparse graphs

We analyze the performance of a simple randomized algorithm for finding 2-factors in directed Hamiltonian graphs of out-degree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2-factor in O(n2) expected time. The analysis of our algorithm is based on random walks on the line and interestingly resembles the analysis of a randomized algorithm for the 2-SAT problem given by Papadimitriou [On selecting a satisfying truth assignment, in: Proc. 32nd Annual IEEE Symp. on the Foundations of Computer Science (FOCS), 1991, p. 163]. For the undirected case, the algorithm finds a 2-factor in O(n3) expected time. We also analyze random versions of these graphs and show that cycles of length Ω(n/logn) can be found with high probability in polynomial time. This partially answers an open question of Broder et al. [Finding hidden Hamilton cycles, Random Structures Algorithms 5 (1994) 395] on finding hidden Hamiltonian cycles in sparse random graphs and improves on a result of Karger et al. [On approximating the longest path in a graph, Algorithmica 18 (1997) 82].

[1]  G. Grimmett,et al.  Probability and random processes , 2002 .

[2]  Chris Bailey-Kellogg,et al.  A random graph approach to NMR sequential assignment. , 2005 .

[3]  Sanjeev Khanna,et al.  Approximating Longest Directed Path , 2003, Electron. Colloquium Comput. Complex..

[4]  Rajeev Motwani,et al.  Finding large cycles in Hamiltonian graphs , 2005, SODA '05.

[5]  Andreas Björklund,et al.  Finding a Path of Superlogarithmic Length , 2002, ICALP.

[6]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[7]  David R. Karger,et al.  On approximating the longest path in a graph , 1997, Algorithmica.

[8]  Chris Bailey-Kellogg,et al.  A random graph approach to NMR sequential assignment , 2004, J. Comput. Biol..

[9]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[10]  Donald E. Knuth,et al.  Stable Networks and Product Graphs , 1995 .

[11]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[12]  Rajeev Motwani,et al.  Approximating the Longest Cycle Problem in Sparse Graphs , 2002, SIAM J. Comput..

[13]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[14]  Frank Harary,et al.  Graph Theory , 2016 .

[15]  C.H. Papadimitriou,et al.  On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[16]  Alan M. Frieze,et al.  Finding Hidden Hamiltonian Cycles , 1994, Random Struct. Algorithms.

[17]  Ján Plesník,et al.  The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two , 1979, Inf. Process. Lett..

[18]  Harold N. Gabow,et al.  Finding paths and cycles of superpolylogarithmic length , 2004, STOC '04.