A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Given a graph and terminal pairs (s i , t i ), i ∈ [k], the edge-disjoint paths problem is to determine whether there exist s i t i paths, i ∈ [k], that do not share any edges. We consider this problem on acyclic digraphs. It is known to be NP-complete and solvable in time n O(k) where n is the number of nodes. It has been a long-standing open question whether it is fixed-parameter tractable in k, i.e. whether it admits an algorithm with running time of the form f (k) n O(1) . We resolve thisdoi:10.1007/978-3-540-39658-1_44 fatcat:ziapmseqyngvtbvylnvezo2cqm