Finding paths and cycles of superpolylogarithmic length

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 407-416

  Gabow, Harold N ^a  

^a UCB 450   (United States)

Author keywords

Approximation algorithms; Cycle; Graph algorithms; Path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COLOR CODES; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

GRAPH ALGORITHMS; POLYNOMIAL TIME ALGORITHMS; SUBGRAPH HOMEOMORPHISM PROBLEMS; SUPERPOLYLOGARITHMIC LENGTH;

COMPUTATIONAL COMPLEXITY;

EID: 4544299473     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007418     Document Type: Conference Paper

References (14)

1. N. Alon, R. Yuster and U. Zwick, Color-coding, J. ACM 42 (1995), pp. 844-856.
2. H.L. Bodlaender, Minor testa with depth-first search, J. Algorithms, 14 (1993), pp. 1-23.
3. A. Björklund and T. Husfeldt, Finding a path of superlogarithmic length, SIAM J. Comput. 32, 6 (2003), pp. 1395-1402.
4. A. Björklund, T. Husfeldt and S. Khanna, Approximating longest directed path, Electronic Colloq. on Comp. Complexity, Rept. No. 32, 2003.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd Ed., McGraw-Hill, NY, 2001.
6. M.R. Fellows and M.A. Langston, Nonconstructive tools for proving polynomial-time decidability, J. ACM 35 (1988), pp. 727-739.
7. H.N. Gabow and S. Nie, Finding a long directed cycle, Proc. 15th Annual ACM-SIAM Symp. Disc. Alg., 2004, pp. 49-58.
8. J.E. Hopcroft and R.E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2,3 (1973), pp. 135-158.
9. D. Karger, R. Motwani and G.D.S. Ramkumar, On approximating the longest path in a graph, Algorithmica 18 (1997), pp. 82-98.
10. A.S. LaPaugh and R.L. Rivest, The subgraph homeomorphism problem, J. Comput. Sys. Sci. 20 (1980), pp. 133-149.
11. B. Monien, How to find long paths efficiently, Annals Disc. Math., 25 (1985), pp. 239-254.
12. N. Robertson and P.D. Seymour, Graph Minors. XIII: The disjoint paths problem, J. Comb. Th. B 63 (1995), pp. 65-110.
13. R.E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
14. D.B. West, Introduction to Graph Theory, 2nd Ed., Prentice Hall (2001).