can be solved in linear time on trees, and the treewidth is a rather small graph parameter in the networks of the PESPlib …, it is a natural question to ask whether there are polynomial-time algorithms for input networks of bounded treewidth, or … when the treewidth is 2, the branchwidth is 2, or the carvingwidth is 3. Analogous results hold for the optimization of …

for instances with bounded treewidth; however, the corresponding runtime is exponential in the treewidth with the maximum …

for instances with bounded treewidth; however, the corresponding runtime is exponential in the treewidth with the maximum …