Finding a path of superlogarithmic length

SIAM Journal on Computing

Volumn 32, Issue 6, 2003, Pages 1395-1402

  Björklund, Andreas ^a   Husfeldt, Thore ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Approximation algorithms; Graph algorithms; Longest path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COLOR CODES; HAMILTONIANS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; LONGEST PATH;

GRAPH THEORY;

EID: 0942288266     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702416761     Document Type: Article

References (11)

1. N. ALON, R. YUSTER, AND U. ZWICK, Color-coding, J. ACM, 42 (1995), pp. 844-856.
2. A. BJÖRKLUND, T. HUSFELDT, AND S. KHANNA, Approximating Longest Directed Path, Technical report TR03-032, Electronic Colloquium on Computational Complexity, Vol. 10, 2003.
3. H. L. BODLAENDER, On linear time minor tests with depth-first search, J. Algorithms, 14 (1993), pp. 1-23.
4. J. A. BONDY AND S. C. LOCKE, Relative length of paths and cycles in 3-connected graphs, Discrete Math., 33 (1981), pp. 111-122.
5. T. FEDER, R. MOTWANI, AND C. SUBI, Approximating the longest cycle problem in sparse graphs, SIAM J. Comput., 31 (2002), pp. 1596-1607.
6. H. N. GABOW AND S. NIE, Finding a Long Directed Cycle, CU Technical report CU-CS-961-03, University of Colorado, Boulder, CO, 2003.
7. D. KARGER, R. MOTWANI, AND G. D. S. RAMKUMAR, On approximating the longest path in a graph, Algorithmica, 18 (1997), pp. 82-98.
8. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
9. B. MONIEN, How to find long paths efficiently, Ann. Discrete Math., 25 (1985), pp. 239-254.
10. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. System Sci., 53 (1996), pp. 161-170.
11. S. VISHWANATHAN, An approximation algorithm for finding a long path in Hamiltonian graphs, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000, pp. 680-685.