Testing branch-width
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2080246 (Why is no real title available?)
- A Parametrized Algorithm for Matroid Branch-Width
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Constructive linear time algorithms for branchwidth
- Graph minors. X: Obstructions to tree-decomposition
- Graph-Theoretic Concepts in Computer Science
Cited in
(17)- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Tangle and Maximal Ideal
- Partitions versus sets: a case of duality
- Submodular partition functions
- Decomposition width of matroids
- Fast FPT-approximation of branchwidth
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Computing with tangles
- Testing Bandwidth k for k-Connected Graphs
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- First order convergence of matroids
- Bounding branch-width
- Finding branch-decompositions of matroids, hypergraphs, and more
- Rank-width: algorithmic and structural results
- Covering Vectors by Spaces: Regular Matroids
- scientific article; zbMATH DE number 1304318 (Why is no real title available?)
This page was built for publication: Testing branch-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875941)