Parameterized complexity of isometric path partition: treewidth and diameter

Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud +2

We investigate the parameterized complexity of the Isometric Path Partition problem when parameterized by the treewidth ($\mathrm{tw}$) of the input graph, arguably one of the most…