How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length

Michael Kiran Huber

We study the Short Path Packing problem which asks, given a graph $G$, integers $k$ and $\ell$, and vertices $s$ and $t$, whether there exist $k$ pairwise internally vertex-disjoin…