Parameterized Complexity of $(A,\ell )$-Path Packing

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki +6

Given a graph $G=(V,E)$, $A\subseteq V$, and integers $k$ and $\ell$, the \textsc{$(A,\ell )$-Path Packing} problem asks to find $k$ vertex-disjoint paths of length $\ell$ that h…