Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Cornelius Brand, Esra Ceylan, Christian Hatschka +2

Decompositional parameters such as treewidth are commonly used to obtain fixed-parameter algorithms for NP-hard graph problems. For problems that are W[1]-hard parameterized by tre…