Finding a long directed cycle

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

  Gabow, Harold N ^a,b   Nie, Shuxin ^a,b  

^a UNIVERSITY OF COLORADO   (United States)

^b University of Colorado   (United States)

Author keywords

Approximation algorithms; Circumference; Cycles; Hamiltonian cycles; Long cycles

Indexed keywords

CIRCUMFERENCE; HAMILTONIAN CYCLES; LONG CYCLES;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; POLYNOMIALS; SEARCH ENGINES;

GRAPH THEORY;

EID: 42149134923     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328918     Document Type: Article

References (17)

1. AHO, A., HOPCROFT, J., AND ULLMAN, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
2. ALON, N., YUSTER, R., AND ZWICK, U. 1997. Finding and counting given length cycles. Algorithmica 17, 209-223.
3. ALON, N., YUSTER, R., AND ZWICK, U. 1995. Color-Coding. J. ACM 42, 844-856.
4. BJÖRKLUND, A., AND H.USFELDT, T. 2003. Finding a path of superlogarithmic length. SIAM J. Comput. 32, 6, 1395-1402.
5. BJÖRKLUND, A., HUSEELDT, T., AND KHANNA, S. 2004. Approximating longest directed paths and cycles. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3142, J. Diaz et al., eds. Springer, 222-233.
6. BODLAENDER, H. 1993. Minor tests with depth-first search. J. Algor. 14, 1-23.
7. BOLLOBÁS, B. 1998. Modern Graph Theory. Springer, NY.
8. COPPERSMITH, D., AND WINOGRAD, S. 1990. Matrix multiplication via arithmetic progressions. J. Symbol. Comp. 9, 251-280.
9. FELLOWS, M., AND LANGSTON, M. 1994. On search, decision and the efficiency of polynomial-time algorithms. J. Comput. Syst. Sci. 49, 769-779.
10. FELLOWS, M., AND LANGSTON, M. 1988. Nonconstructive tools for proving polynomial-time decidability. J. ACM 35, 727-739.
11. GABOW, H. 2007. Finding paths and cycles of superpolylogarithmic length. SIAM J. Comput. 36, 1648-1671.
12. IMPAGLIAZZO, R., AND PATURI, R. 2001. On the complexity of k-sat. J. Comput. Syst. Sci. 62, 367-375.
13. KHULLER, S., RAGHAVACHARI, B., AND YOUNG, N. 1995. Approximating the minimum equivalent digraph. SIAM J. Comput. 24, 859-872.
14. MONIEN, B. 1985. How to find long paths efficiently. Ann. Discr. Math. 25, 239-254.
15. TARJAN, R. 1974. Finding dominators in directed graphs. SIAM J. Comput. 3, 62-89.
16. TARJAN, R. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146-160.
17. YUSTER, R., AND ZWICK, U. 1997. Finding even cycles even faster. SIAM J. Discr. Math. 10, 209-222.