Optimal Bounds for the k-Disjoint Paths Problem

Dario Cavallaro, Maximilian Gorsky, Stephan Kreutzer +2

The Graph Minors Series of Robertson and Seymour forms the foundation of algorithmic structural graph theory, yielding fixed-parameter algorithms for problems such as Disjoint Path…