A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth

DongYun Byun, Akira Matsubayashi

The $k$ vertex-disjoint paths problem asks whether, given a graph $G$ and $k$ pairs of vertices $(s_1,t_1)$, \ldots, $(s_k,t_k)$, $G$ has $k$ pairwise vertex-disjoint paths connect…