Efficient Algorithms for the Longest Path Problem
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, very few graph classes are known where the longest path problem can be solved efficiently. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and it then solves the longest path problem efficiently for weighted trees, block graphs, ptolemaic graphs, and cacti. We next propose three new graph classes that have natural interval representations, and show that the longest path problem can be solved efficiently on those classes. As a corollary, it is also shown that the problem can be solved efficiently on threshold graphs.
KeywordsEfficient algorithms graph classes longest path problem
Unable to display preview. Download preview PDF.
- 3.Balister, P.N., Györi, E., Lehel, J., Schelp, R.H.: Longest Paths in Circular Arc Graphs. Technical report, U. of Memphis (2002), http://www.msci.memphis.edu/preprint.html
- 13.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 14.Gabow, H.N.: Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In: Proc. 1st Ann. ACM-SIAM Symp. on Discr. Algo., pp. 434–443. ACM, New York (1990)Google Scholar
- 16.Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. In: Ann. Discr. Math., vol. 57, 2/e. Elsevier, Amsterdam (2004)Google Scholar
- 17.Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company (1995)Google Scholar
- 25.Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)Google Scholar
- 26.Vishwanathan, S.: An Approximation Algorithm for Finding a Long Path in Hamiltonian Graphs. In: Proc. 11th Ann. ACM-SIAM Symp. on Discr. Algo., pp. 680–685. ACM, New York (2000)Google Scholar