Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Computing and counting longest paths on circular-arc graphs in polynomial time.

Mertzios, G.B. and Bezakova, I. (2011) 'Computing and counting longest paths on circular-arc graphs in polynomial time.', Electronic notes in discrete mathematics., 37 . pp. 219-224.

Abstract

The longest path problem asks for a path with the largest number of vertices in a given graph. The first polynomial time algorithm (with running time O(n4)) has been recently developed for interval graphs. Even though interval and circular-arc graphs look superficially similar, they differ substantially, as circular-arc graphs are not perfect. In this paper, we prove that for every path P of a circular-arc graph G, we can appropriately “cut” the circle, such that the obtained (not induced) interval subgraph G′ of G admits a path P′ on the same vertices as P. This non-trivial result is of independent interest, as it suggests a generic reduction of a number of path problems on circular-arc graphs to the case of interval graphs with a multiplicative linear time overhead of O(n). As an application of this reduction, we present the first polynomial algorithm for the longest path problem on circular-arc graphs, which turns out to have the same running time O(n4) with the one on interval graphs, as we manage to get rid of the linear overhead of the reduction. This algorithm computes in the same time an n-approximation of the number of different vertex sets that provide a longest path; in the case where G is an interval graph, we compute the exact number. Moreover, our algorithm can be directly extended with the same running time to the case where every vertex has an arbitrary positive weight.

Item Type:Article
Additional Information:Event URL: http://www-2.dc.uba.ar/lagos2011/
Keywords:Circular-arc graphs, Interval graphs, Longest path problem, Counting, Approximation algorithm, dynamic programming.
Full text:PDF - Accepted Version (418Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1016/j.endm.2011.05.038
Publisher statement:NOTICE: this is the author’s version of a work that was accepted for publication in Electronic notes in discrete mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic notes in discrete mathematics, 37, 2011, 10.1016/j.endm.2011.05.038
Record Created:21 Feb 2012 13:20
Last Modified:24 Feb 2012 15:04

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