1 paper · 1 filter
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set o…