Parameterizing Path Partitions

Henning Fernau, Florent Foucaud, Kevin Mann +2

We study the algorithmic complexity of partitioning the vertex set of a given (di)graph into a small number of paths. The Path Partition problem (PP) has been studied extensively,…