Algorithms for long paths in graphs

Theoretical Computer Science

Volumn 377, Issue 1-3, 2007, Pages 25-34

  Zhang, Zhao ^a   Li, Hao ^b,c  

^a XINJIANG UNIVERSITY   (China)

^b CNRS   (France)

^c LANZHOU UNIVERSITY   (China)

Author keywords

Hamiltonian; Long path; Neighborhood condition

Indexed keywords

ALGORITHMS; HAMILTONIANS; NUMERICAL METHODS; POLYNOMIALS;

INDEPENDENT VERTICES; LONG PATH; NEIGHBORHOOD CONDITIONS; POLYNOMIAL ALGORITHMS;

GRAPH THEORY;

EID: 34247620172     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.012     Document Type: Article

References (17)

1. Albertson M. Finding Hamiltonian cycles in ore graphs. Congr. Numer. 58 (1987) 25-27
2. N. Alon, R. Yuster, U. Zwick, Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs, in: Proceedings of STOC, 1994, pp. 326-335
3. C. Bazgan, M. Santha, Z. Tuza, On the approximability of finding a(nother) Hamiltonian cycles in cubic Hamiltonian graphs, in: Proceedings of STACS, 1998
4. Bermond J.-C. On Hamiltonian walks. Proc. Fifth British Combinatorial Conference. Aberdeen, 1975. Util. Math. (1975) 41-51
5. Björklund A., and Husfeldt T. Finding a path of superlogarithmic length. SIAM J. Comput. 32 (2003) 1395-1402
6. Bodlaender H.L. On linear time minor tests with depth-first search. J. Algorithms 14 (1993) 1-23
7. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), Macmillan Press
8. Dirac G.A. Some theorems on abstract graphs. Proc. London Math. Soc. (3) 2 (1952) 69-81
9. T. Feder, R. Motwani, C.S. Subi, Finding long paths and cycles in sparse Hamiltonian graphs, in: Proceedings 32th STOC, 2000, pp. 524-529
10. Flandrin E., Jung H.A., and Li H. Degree sum, neighbourhood intersections and Hamiltonism. Discrete Math. 90 (1991) 41-52
11. Kocay W., and Li P.C. An algorithm for finding a long path in a graph. Util. Math. 45 (1994) 169-185
12. Korte B., and Vygen J. Combinatorial Optimization: Theory and Algorithms (2000), Springer-Verlag, Berlin
13. Karger D., Motwani R., and Ramkumar G.D.S. On approximating the longest path in a graph. Algorithmica 18 (1997) 82-98
14. Monien B. How to find long paths efficiently. Ann. Discrete Math. (1985) 239-254
15. Ore O. Note on Hamilton circuits. Amer. Math. Monthly 67 (1960) 55
16. S. Vishwanathan, An approximation algorithm for finding a long path in Hamiltonian graphs, in: Proceedings 11th SODA, 2000, pp. 680-685
17. Wei B. Longest cycles in 3-connected graphs. Discrete Math. 170 1-3 (1997) 195-201