The longest path problem is polynomial on interval graphs

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

Volumn 5734 LNCS, Issue , 2009, Pages 403-414

  Ioannidou, Kyriaki ^a   Mertzios, George B ^b   Nikolopoulos, Stavros D ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Complexity; Dynamic programming; Interval graphs; Longest path problem; Polynomial algorithm

Indexed keywords

COMPLEXITY; GENERAL GRAPH; HAMILTONIAN PATH PROBLEMS; INPUT GRAPHS; INTERVAL GRAPH; INTERVAL GRAPHS; LONGEST PATH PROBLEM; LONGEST PATH PROBLEMS; NP-HARD; POLYNOMIAL ALGORITHM; POLYNOMIAL SOLUTION; POLYNOMIAL-TIME;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; SYSTEMS ENGINEERING;

GRAPH THEORY;

EID: 70349312635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_35     Document Type: Conference Paper

References (23)

1. Arikati, S.R., Pandu Rangan, C.: Linear algorithm for optimal path cover problem on interval graphs. Inform. Proc. Lett. 35, 149-153 (1990)
2. Bertossi, A.A.: Finding Hamiltonian circuits in proper interval graphs. Inform. Proc. Lett. 17, 97-101 (1983)
3. Bulterman, R., van der Sommen, F., Zwaan, G., Verhoeff, T., van Gasteren, A., Feijen, W.: On computing a longest path in a tree. Inform. Proc. Lett. 81, 93-96 (2002)
4. Damaschke, P., Deogun, J.S., Kratsch, D., Steiner, G.: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm. Order 8, 383-391 (1992) 1.
5. Damaschke, P.: The Hamiltonian circuit problem for circle graphs is NP-complete. Inform. Proc. Lett. 32, 1-2 (1989)
6. Damaschke, P.: Paths in interval graphs and circular arc graphs. Discrete Math. 112, 49-64 (1993)
7. Feder, T., Motwani, R.: Finding large cycles in Hamiltonian graphs. In: Proc. 16th annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 166-175. ACM, New York (2005)
8. Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. In: Proc. 36th annual ACM Symp. on Theory of Computing (STOC), pp. 407-416. ACM, New York (2004)
9. Gabow, H.N., Nie, S.: Finding long paths, cycles and circuits. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.5369, pp. 752-763. Springer, Heidelberg (2008)
10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, San Francisco (1979)
11. Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Computing 5, 704-714 (1976)
12. Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology 2, 139-152 (1995)
13. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.57. North-Holland Publishing Co., Amsterdam (2004)
14. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamiltonian paths in grid graphs. SIAM J. Computing 11, 676-686 (1982)
15. Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica 18, 82-98 (1997)
16. Keil, J.M.: Finding Hamiltonian circuits in interval graphs. Inform. Proc. Lett. 20, 201-206 (1985)
17. Müller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156, 291-298 (1996)
18. Ramalingam, G., Pandu Rangan, C.: A unified approach to domination problems on interval graphs. Inform. Proc. Lett. 27, 271-274 (1988) (Pubitemid 18611833)
19. Takahara, Y., Teramoto, S., Uehara, R.: Longest path problems on ptolemaic graphs. IEICE Trans. Inf. and Syst. 91-D, 170-177 (2008)
20. Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.3341, pp. 871-883. Springer, Heidelberg (2004)
21. Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inform. Proc. Lett. 103, 71-77 (2007)
22. Vishwanathan, S.: An approximation algorithm for finding a long path in Hamil-tonian graphs. In: Proc. 11th annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 680-685. ACM, New York (2000)
23. Zhang, Z., Li, H.: Algorithms for long paths in graphs. Theoret. Comput. Sci. 377, 25-34 (2007) 10.