The Longest Path Problem Is Polynomial on Interval Graphs

The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, as it is a generalization of the Hamiltonian path problem. Motivated by the work of Uehara and Uno in [20], where they left the longest path problem open for the class of interval graphs, in this paper we show that the problem can be solved in polynomial time on interval graphs. The proposed algorithm runs in O(n4 ) time, where n is the number of vertices of the input graph, and bases on a dynamic programming approach.

• Type: Conference
• Year: 2009
• Where: MFCS
• Authors: Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
• Keywords: Hamiltonian Path Problem, Interval Graphs, Longest Path Problem, MFCS 2009, Theoretical Computer Science