Tight Bounds for Linkages in Planar Graphs

The Disjoint-Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and ti, for i = 1,..., k. In their f(k) ċ n3 algorithm for this problem, Robertson and Seymour introduced the irrelevant vertex technique according to which in every instance of treewidth greater than g(k) there is an "irrelevant" vertex whose removal creates an equivalent instance of the problem. This fact is based on the celebrated Unique Linkage Theorem, whose - very technical - proof gives a function g(k) that is responsible for an immense parameter dependence in the running time of the algorithm. In this paper we prove this result for planar graphs achieving g(k) = 2O(k). Our bound is radically better than the bounds known for general graphs. Moreover, our proof is new and self-contained, and it strongly exploits the combinatorial properties of planar graphs. We also prove that our result is optimal, in the sense that the function g(k) cannot become better than exponential. Our results suggest that any algorithm for the DISJOINT-PATHS PROBLEM that runs in time better than 22o(k) ċnO(1) will probably require drastically different ideas from those in the irrelevant vertex technique.

[1]  Xingxing Yu,et al.  4-Connected Projective-Planar Graphs Are Hamiltonian , 1994, J. Comb. Theory, Ser. B.

[2]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[3]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[4]  Alexander Schrijver,et al.  Finding k Disjoint Paths in a Directed Planar Graph , 1994, SIAM J. Comput..

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

[6]  Fedor V. Fomin,et al.  Subexponential parameterized algorithm for minimum fill-in , 2011, SODA.

[7]  Dániel Marx,et al.  Slightly superexponential parameterized problems , 2011, SODA '11.

[8]  W. T. Tutte.  A THEOREM ON PLANAR GRAPHS , 1956 .

[9]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[10]  Bruce A. Reed,et al.  Odd cycle packing , 2010, STOC '10.

[11]  Dániel Marx,et al.  Structure theorem and isomorphism test for graphs with excluded topological subgraphs , 2011, STOC '12.

[12]  Stephan Kreutzer,et al.  Locally Excluding a Minor , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[13]  Ken-ichi Kawarabayashi,et al.  The Induced Disjoint Paths Problem , 2008, IPCO.

[14]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

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

[16]  Paul D. Seymour,et al.  Graph Minors. XXII. Irrelevant vertices in linkage problems , 2012, J. Comb. Theory, Ser. B.

[17]  Stephan Kreutzer,et al.  Domination Problems in Nowhere-Dense Classes , 2009, FSTTCS.

[18]  Dimitrios M. Thilikos,et al.  Planar Disjoint-Paths Completion , 2011, IPEC.

[19]  Petr A. Golovach,et al.  Induced Packing of Odd Cycles in a Planar Graph , 2009, ISAAC.

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

[21]  Nicolas Trotignon,et al.  Graphs that do not contain a cycle with a node that has at least two neighbors on it , 2013, SIAM J. Discret. Math..

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

[23]  Robert Warren,et al.  Lower bounds on the pathwidth of some grid-like graphs , 2008, Discret. Appl. Math..

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

[25]  Hisao Tamaki,et al.  Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size , 2010, ISAAC.

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

[27]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[28]  VERSION , 1922 .

[29]  W. Marsden.  I and J , 2012 .

[30]  Carsten Thomassen,et al.  A theorem on paths in planar graphs , 1983, J. Graph Theory.

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

[32]  B. Grünbaum.  Polytopes, graphs, and complexes , 1970 .

[33]  Jens Vygen,et al.  NP-completeness of Some Edge-disjoint Paths Problems , 1995, Discret. Appl. Math..

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

[35]  F. Harary.  New directions in the theory of graphs , 1973 .

[36]  Paul Seymour,et al.  Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA , 1993, Graph Structure Theory.