The Longest Path Problem has a Polynomial Solution on Interval Graphs

  • Authors:

  • Kyriaki Ioannidou;George B. Mertzios;Stavros D. Nikolopoulos

  • Affiliations:

  • University of Ioannina, Department of Computer Science, P.O. Box 1186, 45110, Ioannina, Greece;RWTH Aachen University, Department of Computer Science, Ahornstr. 55, 52074, Aachen, Germany;University of Ioannina, Department of Computer Science, P.O. Box 1186, 45110, Ioannina, Greece

  • Venue:
  • Algorithmica
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 (Proc. of the 15th Annual International Symp. on Algorithms and Computation (ISAAC), LNCS, vol. 3341, pp. 871–883, 2004), 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 uses a dynamic programming approach and runs in O(n 4) time, where n is the number of vertices of the input graph.