Tight Bounds for Linkages in Planar Graphs

Abstract

The Disjoint-Paths Problem asks, given a graph G and a set of pairs of terminals (s ₁,t ₁),…,(s _k ,t _k ), whether there is a collection of k pairwise vertex-disjoint paths linking s _i and t _i , for i = 1,…,k. In their f(k)·n ³ 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) = 2^O(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 $2^{2^{o(k)}}\cdot n^{O(1)}$ will probably require drastically different ideas from those in the irrelevant vertex technique.