On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths

For two positive integers k and ℓ , a ( k × ℓ ) - spindle is the union of k pairwise internally vertex-disjoint directed paths with ℓ arcs each between two vertices u and v . We are interested in the (parameterized) complexity of several problems consisting in deciding whether a given digraph contai...

Ausführliche Beschreibung