A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs

Given a graph $G$, the longest path problem asks to compute a simple path of $G$ with the largest number of vertices. This problem is the most natural optimization version of the well-known and well-studied Hamiltonian path problem, and thus it is NP-hard on general graphs. However, in contrast to the Hamiltonian path problem, there are only a few restricted graph families, such as trees, and some small graph classes where polynomial algorithms for the longest path problem have been found. Recently it has been shown that this problem can be solved in polynomial time on interval graphs by applying dynamic programming to a characterizing ordering of the vertices of the given graph [K. Ioannidou, G. B. Mertzios, and S. D. Nikolopoulos, Algorithmica, 61 (2011), pp. 320--341], thus answering an open question. In the present paper, we provide the first polynomial algorithm for the longest path problem on a much greater class, namely on cocomparability graphs. Our algorithm uses a similar, but essentially simple...

[1]  Ryuhei Uehara,et al.  Longest Path Problems on Ptolemaic Graphs , 2008, IEICE Trans. Inf. Syst..

[2]  J. Mark Keil.  Finding Hamiltonian Circuits in Interval Graphs , 1985, Inf. Process. Lett..

[3]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[4]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[5]  Giri Narasimhan,et al.  A Note on the Hamiltonian Circuit Problem on Directed Path Graphs , 1989, Inf. Process. Lett..

[6]  Haiko Müller,et al.  Hamiltonian circuits in chordal bipartite graphs , 1996, Discret. Math..

[7]  Derek G. Corneil,et al.  Lexicographic Breadth First Search - A Survey , 2004, WG.

[8]  Derek G. Corneil,et al.  A Unified View of Graph Searching , 2008, SIAM J. Discret. Math..

[9]  Peter Damaschke,et al.  The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete , 1989, Inf. Process. Lett..

[10]  A. J. M. van Gasteren,et al.  On computing a longest path in a tree , 2002, Inf. Process. Lett..

[11]  Stephan Olariu,et al.  The LBFS Structure and Recognition of Interval Graphs , 2009, SIAM J. Discret. Math..

[12]  Peter Damaschke,et al.  Paths in interval graphs and circular arc graphs , 1993, Discret. Math..

[13]  D. Kratsch,et al.  Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm , 1991 .

[14]  Stephan Olariu,et al.  Linear Orderings of Subfamilies of AT-Free Graphs , 2006, SIAM J. Discret. Math..

[15]  Stavros D. Nikolopoulos,et al.  The Longest Path Problem has a Polynomial Solution on Interval Graphs , 2011, Algorithmica.

[16]  George Steiner,et al.  Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs , 1994, SIAM J. Comput..

[17]  C. Pandu Rangan,et al.  Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..

[18]  David R. Karger,et al.  On approximating the longest path in a graph , 1997, Algorithmica.

[19]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[20]  Dieter Kratsch,et al.  Domination on Cocomparability Graphs , 1993, SIAM J. Discret. Math..

[21]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[22]  Stephan Olariu,et al.  An Optimal Greedy Heuristic to Color Interval Graphs , 1991, Inf. Process. Lett..

[23]  Jeremy P. Spinrad,et al.  Linear-time modular decomposition and efficient transitive orientation of comparability graphs , 1994, SODA '94.

[24]  Richard Krueger.  Graph searching , 2005 .

[25]  Ryuhei Uehara,et al.  Efficient Algorithms for the Longest Path Problem , 2004, ISAAC.

[26]  Ryuhei Uehara,et al.  Linear structure of bipartite permutation graphs and the longest path problem , 2007, Inf. Process. Lett..

[27]  Stavros D. Nikolopoulos,et al.  The Longest Path Problem Is Polynomial on Cocomparability Graphs , 2011, Algorithmica.

[28]  Alan A. Bertossi,et al.  Finding Hamiltonian Circuits in Proper Interval Graphs , 1983, Inf. Process. Lett..

[29]  Stavros D. Nikolopoulos,et al.  The Longest Path Problem is Polynomial on Cocomparability Graphs , 2010, WG.

[30]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[31]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.