Finding branch-decompositions of matroids, hypergraphs, and more
From MaRDI portal
(Redirected from Publication:5013567)
Combinatorial aspects of matroids and geometric lattices (05B35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)
Recommendations
Cites work
- Approximating clique-width and branch-width
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Call routing and the ratcatcher
- Clique-width is NP-complete
- Constructive algorithm for path-width of matroids
- Constructive linear time algorithms for branchwidth
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Finding Branch-Decompositions and Rank-Decompositions
- Finding odd cycle transversals.
- Graph minors. X: Obstructions to tree-decomposition
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 2080246 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- On Integer Programming and the Branch-Width of the Constraint Matrix
- On the excluded minors for the matroids of branch-width \(k\)
- Testing branch-width
- The rank-width of edge-coloured graphs
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
- Upper bounds to the clique width of graphs
Cited in
(14)- Branch decomposition heuristics for linear matroids
- Constructive algorithm for path-width of matroids
- Finding branch-decompositions of matroids, hypergraphs, and more
- Covering vectors by spaces: regular matroids
- A Parametrized Algorithm for Matroid Branch-Width
- Finding Branch-Decompositions and Rank-Decompositions
- Finding Branch-Decompositions and Rank-Decompositions
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Edge-treewidth: algorithmic and combinatorial properties
- Fast FPT-approximation of branchwidth
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- Approximating branchwidth on parametric extensions of planarity
- Improved bounds for twin-width parameter variants with algorithmic applications to counting graph colorings
- Approximating branchwidth on parametric extensions of planarity
This page was built for publication: Finding branch-decompositions of matroids, hypergraphs, and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013567)
