A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
[article]

2021
*
arXiv
*
pre-print

In the Disjoint Paths problem, the input is an undirected graph G on n vertices and a set of k vertex pairs, {s_i,t_i}_i=1^k, and the task is to find k pairwise vertex-disjoint paths connecting s_i to t_i. The problem was shown to have an f(k)n^3 algorithm by Robertson and Seymour. In modern terminology, this means that Disjoint Paths is fixed parameter tractable (FPT), parameterized by the number of vertex pairs. This algorithm is the cornerstone of the entire graph minor theory, and a vital

arXiv:2103.17041v1
fatcat:ke74owkfrne6jowd4ftafwzlxa