Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


Durham Research Online
You are in:

The longest path problem has a polynomial solution on interval graphs.

Ioannidou, K. and Mertzios, G.B. and Nikolopoulos, S.D. (2011) 'The longest path problem has a polynomial solution on interval graphs.', Algorithmica., 61 (2). pp. 320-341.

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.

Item Type:Article
Keywords:Longest path problem, Interval graphs, Polynomial algorithm, Complexity, Dynamic programming.
Full text:PDF - Accepted Version (231Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1007/s00453-010-9411-3
Publisher statement:The final publication is available at Springer via http://dx.doi.org/10.1007/s00453-010-9411-3.
Record Created:15 Dec 2011 09:35
Last Modified:08 Sep 2014 10:41

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library