Branch-width, parse trees, and monadic second-order logic for matroids
From MaRDI portal
Recommendations
Cited in
(12)- Tree automata and pigeonhole classes of matroids. I
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Decomposition width of matroids
- On decidability of MSO theories of representable matroids
- Directed Nowhere Dense Classes of Graphs
- Mathematical Foundations of Computer Science 2003
- Monadic second-order model-checking on decomposable matroids
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming
- Closure property of contraction-depth of matroids
- Trees, grids, and MSO decidability: from graphs to matroids
This page was built for publication: Branch-width, parse trees, and monadic second-order logic for matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418660)