Parameterizing path partitions

Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N

Abstract: Highlights•We study variants of Path Partitioning problems, for undirected and directed graphs.•We focus on unrestricted paths, shortest paths and induced paths.•We systematically study their classical complexity on some classes of graphs.•We study their parameterized complexity for several parameters.•We introduce the directed neighborhood diversity parameter and show its usefulness.