Efficient algorithms for the longest path problem

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

Volumn 3341, Issue , 2004, Pages 871-883

  Uehara, Ryuhei ^a   Uno, Yushi ^b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b Osaka City University   (Japan)

Author keywords

Efficient algorithms; Graph classes; Longest path problem

Indexed keywords

CLUSTERING ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

BLOCK GRAPHS; EFFICIENT ALGORITHM; GRAPH CLASS; HAMILTONIAN PATH PROBLEMS; LINEAR-TIME ALGORITHMS; LONGEST PATH; LONGEST PATH PROBLEMS; PTOLEMAIC GRAPHS; SIMPLEST LINEAR; WEIGHTED TREE; THRESHOLD GRAPHS;

TREES (MATHEMATICS); GRAPH THEORY;

EID: 35048827876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_74     Document Type: Article

References (26)

1. N. Alon, R. Yuster, and U. Zwick. Color-Coding. J. ACM, 42(4): 844-856, 1995.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, 1999.
3. P. N. Balister, E. Györi, J. Lehel, and R. H. Schelp. Longest Paths in Circular Arc Graphs. Technical report, U. of Memphis, www. msci. memphis. edu/preprint. html, 2002.
4. C. Berge. Hypergraphs. Elsevier, 1989.
5. A. A. Bertossi. Finding Hamiltonian Circuits in Proper Interval Graphs. Info. Proc. Lett. , 17(2): 97-101, 1983.
6. A. A. Bertossi and M. A. Bonuccelli. Hamiltonian Circuits in Interval Graph Generalizations. Info. Proc. Lett. , 23: 195-200, 1986.
7. A. Björklund and T. Husfeldt. Finding a Path of Superlogarithmic Length. SIAM J. Comput. , 32(6): 1395-1402, 2003.
8. K. S. Booth and G. S. Lueker. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. J. Comput. Syst. Sci. , 13: 335-379, 1976.
9. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: A Survey. SIAM, 1999.
10. R. W. Bulterman, F. W. van der Sommen, G. Zwaan, T. Verhoeff, A. J. M. van Gasteren, and W. H. J. Feijen. On Computing a Longest Path in a Tree. Info. Proc. Lett. , 81: 93-96, 2002.
11. P. Damaschke. The Hamiltonian Circuit Problem for Circle Graphs is NP-complete. Info. Proc. Lett. , 32: 1-2, 1989.
12. P. Damaschke. Paths in Interval Graphs and Circular Arc Graphs. Discr. Math. , 112: 49-64, 1993.
13. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
14. H. N. Gabow. Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In Proc. 1st Ann. ACM-SIAM Symp. on Discr. Algo. , 434-443. ACM, 1990.
15. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, 1979.
16. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs, 2/e. Ann. Discr. Math. , 57. Elsevier, 2004.
17. D. Hochbaum (eds. ). Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1995.
18. D. Karger, R. Motwani, and G. D. S. Ramkumar. On Approximating the Longest Path in a Graph. Algorithmica, 18: 82-98, 1997.
19. N. Korte and R. H. Möhring. An Incremental Linear-Time Algorithm for Recognizing Interval Graphs. SIAM J. Comput. , 18(1): 68-81, 1989.
20. N. V. R. Mahadev and U. N. Peled. Longest Cycles in Threshold Graphs. Discr. Math. , 135: 169-176, 1994.
21. B. Monien. How to Find Long Paths Efficiently. Ann. Discr. Math. , 25: 239-254, 1985.
22. H. Müller. Hamiltonian Circuit in Chordal Bipartite Graphs. Disc. Math. , 156: 291-298, 1996.
23. M. G. Scutellà. An Approximation Algorithm for Computing Longest Paths. European J. Oper. Res. , 148(3): 584-590, 2003.
24. J. Spinrad, A. Brandstädt, and L. Stewart. Bipartite Permutation Graphs. Discr. Appl. Math. , 18: 279-292, 1987.
25. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
26. S. Vishwanathan. An Approximation Algorithm for Finding a Long Path in Hamiltonian Graphs. In Proc. 11th Ann. ACM-SIAM Symp. on Discr. Algo. , 680-685. ACM, 2000.