Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths

08/19/2020
by   Daniel Lokshtanov, et al.
0

In the Disjoint Paths problem, the input consists of an n-vertex graph G and a collection of k vertex pairs, {(s_i,t_i)}_i=1^k, and the objective is to determine whether there exists a collection {P_i}_i=1^k of k pairwise vertex-disjoint paths in G where the end-vertices of P_i are s_i and t_i. This problem was shown to admit an f(k)n^3-time algorithm by Robertson and Seymour (Graph Minors XIII, The Disjoint Paths Problem, JCTB). In modern terminology, this means that Disjoint Paths is fixed parameter tractable (FPT) with respect to k. Remarkably, the above algorithm for Disjoint Paths is a cornerstone of the entire Graph Minors Theory, and conceptually vital to the g(k)n^3-time algorithm for Minor Testing (given two undirected graphs, G and H on n and k vertices, respectively, determine whether G contains H as a minor). In this semi-survey, we will first give an exposition of the Graph Minors Theory with emphasis on efficiency from the viewpoint of Parameterized Complexity. Secondly, we will review the state of the art with respect to the Disjoint Paths and Planar Disjoint Paths problems. Lastly, we will discuss the main ideas behind a new algorithm that combines treewidth reduction and an algebraic approach to solve Planar Disjoint Paths in time 2^k^O(1)n^O(1) (for undirected graphs).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2021

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths

In the Disjoint Paths problem, the input is an undirected graph G on n v...
research
07/12/2019

Planar Disjoint Paths in Linear Time

The Disjoint Paths problem asks whether a fixed number of pairs of termi...
research
11/28/2022

On digraphs without onion star immersions

The t-onion star is the digraph obtained from a star with 2t leaves by r...
research
07/13/2023

Planar Disjoint Paths, Treewidth, and Kernels

In the Planar Disjoint Paths problem, one is given an undirected planar ...
research
01/26/2021

A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs

(see paper for full abstract) We show that the Edge-Disjoint Paths pro...
research
09/30/2019

A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps

In the Directed Disjoint Paths problem, we are given a digraph D and a s...
research
07/13/2021

First-Order Logic with Connectivity Operators

First-order logic (FO) can express many algorithmic problems on graphs, ...

Please sign up or login with your details

Forgot password? Click here to reset