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

Information Processing Letters

Volumn 95, Issue 1, 2005, Pages 321-327

  Pandurangan, Gopal ^a  

^a Purdue University   (United States)

Author keywords

2 factor; Graph algorithms; Hamiltonian cycle; Long cycle; Random walks; Randomized algorithms; Sparse graphs

Indexed keywords

DATA PROCESSING; GRAPH THEORY; HAMILTONIANS; MATHEMATICAL MODELS; NUCLEAR MAGNETIC RESONANCE; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; PROTEINS;

2-FACTORS; GRAPH ALGORITHMS; HAMILTONIAN CYCLES; LONG CYCLES; RANDOM WALKS; RANDOMIZED ALGORITHMS; SPARSE GRAPHS;

ALGORITHMS;

EID: 18844370980     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.04.001     Document Type: Article

References (16)

1. D. Angluin, and L. Valiant Fast probabilistic algorithms for Hamiltonian circuits and matchings J. Comput. System Sci. 18 1979 155 193
2. A. Bjorklund, and T. Husfeldt Finding a path of superlogarithmic length SIAM J. Comput. 32 6 2003 1395 1402
3. A. Bjorklund, T. Husfeldt, S. Khanna, Approximating longest directed path, Electronic Colloquium on Computational Complexity, Report No. 32, 2003
4. A. Broder, A. Frieze, and E. Shamir Finding hidden Hamilton cycles Random Structures Algorithms 5 1994 395 410
5. C. Bailey-Kellog, S. Chainraj, G. Pandurangan, A random graph approach for NMR sequential assignment, in: Proc. 8th Annual Internat. Conf. on Research in Computational Molecular Biology (RECOMB), 2004
6. T. Feder Stable networks and product graphs Mem. Amer. Math. Soc. 116 1995 555
7. T. Feder, R. Motwani, and C. Subi Approximating the longest cycle problem in sparse graphs SIAM J. Comput. 31 2002 1596 1607
8. T. Feder, R. Motwani, Finding large cycles in Hamiltonian graphs, in: Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2005, in press
9. H.N. Gabow, Finding paths and cycles of superpolylogarithmic length, in: Proc. 36th ACM Symp. on the Theory of Computing (STOC), 2004, pp. 407-416
10. M.R. Garey, D.S. Johnson, and R.E. Tarjan The planar Hamiltonian circuit problem is NP-complete SIAM J. Comput. 5 1976 704 714
11. A. Gibbons Algorithmic Graph Theory 1985 Cambridge University Press Cambridge, MA
12. G. Grimmett, and D. Stirzaker Probability and Random Processes second ed. 1992 Oxford University Press Oxford
13. D. Karger, R. Motwani, and G.D.S. Ramkumar On approximating the longest path in a graph Algorithmica 18 1997 82 98
14. R. Motwani, and P. Raghavan Randomized Algorithms 1995 Cambridge University Press Cambridge, MA
15. C.H. Papadimitriou, On selecting a satisfying truth assignment, in: Proc. 32nd Annual IEEE Symp. on the Foundations of Computer Science (FOCS), 1991, pp. 163-169
16. J. Plesnik The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two Inform. Proc. Lett. 8 4 1979 199 201