Finding a Long Directed Cycle

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 49-58

  Gabow, Harold N ^a   Nie, Shuxin ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HAMILTONIANS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

DEPTH-FIRST SEARCH; LONG DIRECTED CYCLES;

COMPUTER SCIENCE;

EID: 1842525823     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading MA, 1974.
2. N. Alon, R. Yuster and U. Zwick, Color-coding, J. ACM, 42 (1995), pp. 844-856.
3. N. Alon, R. Yuster and U. Zwick, Finding and counting given length cycles, Algorithmica, 17 (1997), pp. 209-223.
4. H.L. Bodlaender, Minor tests with depth-first search, J. Algorithms, 14 (1993), pp. 1-23.
5. A. Björklund and T. Husfeldt, Finding a path of superlogarithmic length, Proc. 29th Int. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Sci. 2380, pp. 985-992, Springer Verlag, 2002.
6. A. Björklund, T. Husfeldt and S. Khanna, Approximating longest directed path, Electronic Colloq. on Comp. Complexity, Rept. No. 32, 2003.
7. M.R. Fellows and M.A. Langston, Nonconstructive tools for proving polynomial-time decidability, J. ACM, 35 (1988), pp. 727-739.
8. M.R. Fellows and M.A. Langston, On search, decision and the efficiency of polynomial-time algorithms, Proc. 21st Annual ACM Symp. on Th. Comput., 1989, pp. 501-512.
9. R. Impagliazzo and R. Paturi, On the complexity of k-SAT, J. Gomp. Sys. Sci., 62 (2001), pp. 367-375.
10. B. Monien, How to find long paths efficiently, Annals Disc. Math., 25 (1985), pp. 239-254.
11. R.E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
12. R. Tarjan, Finding dominators in directed graphs, SIAM J. Comput., 3 (1974), pp. 62-89.
13. R. Yuster and U. Zwick, Finding even cycles even faster, SIAM J. Disc. Math., 10 (1997), pp. 209-222.