The graphs with the max-Mader-flow-min-multiway-cut property

Guyslain Naves, Vincent Jost

We are given a graph $G$, an independant set $\mathcal{S}\subset V(G)$ of \emph{terminals}, and a function $w:V(G)\to \mathbb{N}$. We want to know if the maximum $w$-packing of v…