Presents the first single-exponential algorithm for hypergraph branchwidth at O*(4^n) and an improved O(3.293^n) algorithm for graphs that also outperforms prior practical implementations.
15th International Symposium on Parameterized and Exact Computation,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast and Practical Single-Exponential Algorithms for Branchwidth
Presents the first single-exponential algorithm for hypergraph branchwidth at O*(4^n) and an improved O(3.293^n) algorithm for graphs that also outperforms prior practical implementations.