Approximating branchwidth on parametric extensions of planarity
From MaRDI portal
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Parametrized Algorithm for Matroid Branch-Width
- Abstract separation systems
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Branch-width and Rota's conjecture
- Branch-width and well-quasi-ordering in matroids and graphs.
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Branchwidth of chordal graphs
- Call routing and the ratcatcher
- Complexity of Finding Embeddings in a k-Tree
- Computing the branchwidth of interval graphs
- Constructive linear time algorithms for branchwidth
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Finding Branch-Decompositions and Rank-Decompositions
- Finding branch-decompositions of matroids, hypergraphs, and more
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XVI: Excluding a non-planar graph
- Graph theory
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
- Profinite separation systems
- Satisfiability, branch-width and Tseitin tautologies
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
- Structural submodularity and tangles in abstract separation systems
- Tangle-tree duality: in graphs, matroids and beyond
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Über eine Eigenschaft der ebenen Komplexe
This page was built for publication: Approximating branchwidth on parametric extensions of planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988698)
