The disjoint paths problem in quadratic time

We consider the following well-known problem, which is called the disjoint paths problem. For a given graph G and a set of k pairs of terminals in G, the objective is to find k vertex-disjoint paths connecting given pairs of terminals or to conclude that such paths do not exist. We present an O(n^2) time algorithm for this problem for fixed k. This improves the time complexity of the seminal result by Robertson and Seymour, who gave an O(n^3) time algorithm for the disjoint paths problem for fixed k. Note that Perkovic and Reed (2000) announced in [24] (without proofs) that this problem can be solved in O(n^2) time. Our algorithm implies that there is an O(n^2) time algorithm for the k edge-disjoint paths problem, the minor containment problem, and the labeled minor containment problem. In fact, the time complexity of all the algorithms with the most expensive part depending on Robertson and [email protected]?s algorithm can be improved to O(n^2), for example, the membership testing for minor-closed class of graphs.

[1]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[2]  Paul Wollan,et al.  A shorter proof of the graph minor algorithm: the unique linkage theorem , 2010, STOC '10.

[3]  Bruce A. Reed,et al.  Finding disjoint trees in planar graphs in linear time , 1991, Graph Structure Theory.

[4]  James F. Lynch,et al.  The equivalence of theorem proving and the interconnection problem , 1975, SIGD.

[5]  Éva Tardos,et al.  Approximations for the disjoint paths problem in high-diameter planar networks , 1995, STOC '95.

[6]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[7]  András Frank.  Edge-disjoint paths in planar graphs , 1985, J. Comb. Theory, Ser. B.

[8]  Paul D. Seymour.  Disjoint paths in graphs , 2006, Discret. Math..

[9]  Paul D. Seymour,et al.  Graph minors. XXI. Graphs with unique linkages , 2009, J. Comb. Theory, Ser. B.

[10]  Sanjeev Khanna,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[11]  B. Reed.  Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications , 1997 .

[12]  Jon M. Kleinberg,et al.  Decision algorithms for unsplittable flow and the half-disjoint paths problem , 1998, STOC '98.

[13]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[14]  Chandra Chekuri,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[15]  Torsten Tholey.  Solving the 2-Disjoint Paths Problem in Nearly Linear Time , 2004, STACS.

[16]  MATTHIAS MIDDENDORF,et al.  On the complexity of the disjoint paths problem , 1993, Comb..

[17]  Bruce A. Reed,et al.  An Improved Algorithm for Finding Tree Decompositions of Small Width , 1999, WG.

[18]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[19]  Bruce A. Reed,et al.  Finding approximate separators and computing tree width quickly , 1992, STOC '92.

[20]  Torsten Tholey.  Improved Algorithms for the 2-Vertex Disjoint Paths Problem , 2009, SOFSEM.

[21]  Bruce A. Reed,et al.  A linear-time algorithm to find a separator in a graph excluding a minor , 2009, TALG.

[22]  Sanjeev Khanna,et al.  The All-or-Nothing Multicommodity Flow Problem , 2013, SIAM J. Comput..

[23]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[24]  Robin Thomas,et al.  Coloring Triangle-Free Graphs on Surfaces , 2007, ISAAC.

[25]  Bruce A. Reed,et al.  A nearly linear time algorithm for the half integral disjoint paths packing , 2008, SODA '08.

[26]  Carsten Thomassen,et al.  Highly Connected Sets and the Excluded Grid Theorem , 1999, J. Comb. Theory, Ser. B.

[27]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[28]  Jon M. Kleinberg,et al.  Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[29]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[30]  Sanjeev Khanna,et al.  Edge-Disjoint Paths in Planar Graphs with Constant Congestion , 2009, SIAM J. Comput..

[31]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[32]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[33]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[34]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[35]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[36]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[37]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[38]  R. Halin.  S-functions for graphs , 1976 .

[39]  Carsten Thomassen,et al.  2-Linked Graphs , 1980, Eur. J. Comb..

[40]  Ken-ichi Kawarabayashi,et al.  Algorithms for finding an induced cycle in planar graphs , 2010, Comb..

[41]  Bruce A. Reed,et al.  Rooted Routing in the Plane , 1993, Discret. Appl. Math..

[42]  B. Mohar,et al.  Graph Minors , 2009 .

[43]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.