Counting over Unbreakable Decompositions: A Single-Exponential Parameterized Algorithm for Minimum Bisection
The dynamic program can be implemented on top of an unbreakable decomposition using algebraic techniques and compute in time a tree decomposition with adhesions of size at most $2k$ whose bags are $(3k,k)$-edge-unbreakable inside their own subtrees.
Aditya Anand, Evangelos Kipouridis, Karol Węgrzycki
· 0 citations