Tuukka Korhonen, Fast FPT-Approximation of Branchwidth
Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for …

