Finding Maximum Edge-Disjoint Paths Between Multiple Terminals

Satoru Iwata, Yu Yokoi

Let $G=(V,E)$ be a multigraph with a set $T\subseteq V$ of terminals. A path in $G$ is called a $T$-path if its ends are distinct vertices in $T$ and no internal vertices belong to…