On disjoint paths in acyclic planar graphs

Guyslain Naves

We give an algorithm with complexity $O(f(R{)}^{k^2}{k}^{3}n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian. Here, $…