Lindner, Niels; Reisch, Julian - In: Journal of Scheduling 25 (2022) 2, pp. 157-176
when the treewidth is 2, the branchwidth is 2, or the carvingwidth is 3. Analogous results hold for the optimization of … input networks with bounded tree- or branchwidth. We present two such algorithms based on dynamic programming. We further …-activity networks with a special—but standard—structure, we give explicit and sharp bounds on the branchwidth in terms of the maximum …
