Finding long paths, cycles and circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5369 LNCS, Issue , 2008, Pages 752-763

  Gabow, Harold N ^a   Nie, Shuxin ^a  

^a University of Colorado   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; HARDNESS RESULT;

GRAPH THEORY;

ALGORITHMS;

EID: 58549119614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_66     Document Type: Conference Paper

References (21)

1. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42, 844-856 (1995)
2. Bodlaender, H.L.: Minor tests with depth-first search. J. Algorithms 14, 1-23 (1993)
3. Bjorklund, A., Husfeldt, T.: Finding a path of superlogarithmic length. SIAM J. Comput. 32, 1395-1402 (2003)
4. Bjorklund, A., Husfeldt, T., Khanna, S.: Approximating longest directed paths and cycles. In: D(i) az, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 222-233. Springer, Heidelberg (2004)
5. Bazgan, C., Santha, M., Tuza, Z.: On the approximability of finding a(nother) Hamiltonian cycle. In: Proceedings of STACS 1998 (1998)
6. Chen, G., Xu, J., Yu, X.: Circumference of graphs with bounded degree. SIAM J. Comput. 33, 1136-1170 (2004)
7. Fellows, M.R., Langston, M.A.: Nonconstructive tools for proving polynomial-time decidability. J. ACM 35, 727-739 (1988)
8. Fellows, M.R., Langston, M.A.: On search, decision and he efficiency of polynomialtime decidability. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 501-512 (1989)
9. Feder, T., Motwani, R.: Finding large cycles in Hamiltonian graphs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, BC, pp. 166-175 (2005)
10. Feder, T., Motwani, R., Subi, C: Approximating the longest cycle problem in sparse graphs. SIAM J. Comput. 31, 1596-1607 (2002)
11. Fürer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 317-324 (1992)
12. Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. SIAM J. Comput. 36(6), 1648-1671 (2007)
13. Gabow, H.N., Nie, S.: Finding a long directed cycle. ACM Trans, on Algorithms 4(1) Article 7, 21 pages (2008)
14. Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135-158 (1973)
15. Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comp. Sys. Sci. 62(2), 367-375 (2001)
16. Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica 18, 82-98 (1997)
17. LaPaugh, A.S., Rivest, R.L.: The subgraph homeomorphism problem. J. Comput. Sys. Sci. 20, 133-149 (1980)
18. Monien, B.: How to find long paths efficiently. Annals Disc. Math. 25, 239-254 (1985)
19. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. A. Springer, NY (2003)
20. Vishwanathan, S.: An approximation algorithm for finding a long path in Hamiltonian graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 680-685 (2000)
21. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)