A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing

Satoru Iwata, Hirota Kinoshita

Given an undirected graph $G=(V,E)$ with a set of terminals $T\subseteq V$ partitioned into a family $\mathcal{S}$ of disjoint blocks, find the maximum number of vertex-disjoint…