Branch-width, parse trees, and monadic second-order logic for matroids.
From MaRDI portal
Publication:2490835
Recommendations
- scientific article; zbMATH DE number 1962824
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- scientific article; zbMATH DE number 1086493
- Monadic second-order logic on tree-like structures
- Monadic second order logic on tree-like structures
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
- Monadic second order finite satisfiability and unbounded tree-width
- Monadic Second-Order Logic and Transitive Closure Logics over Trees
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- scientific article; zbMATH DE number 4049098 (Why is no real title available?)
- scientific article; zbMATH DE number 4081531 (Why is no real title available?)
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- Approximating clique-width and branch-width
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Branch-width and well-quasi-ordering in matroids and graphs.
- Constructive linear time algorithms for branchwidth
- Graph minors. X: Obstructions to tree-decomposition
- Graph-Theoretic Concepts in Computer Science
- Linear time solvable optimization problems on graphs of bounded clique-width
- Mathematical Foundations of Computer Science 2003
- On the excluded minors for the matroids of branch-width \(k\)
- Parameterized and Exact Computation
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The structure of the models of decidable monadic theories of graphs
- Upper bounds to the clique width of graphs
Cited in
(25)- Confronting intractability via parameters
- Fast FPT-approximation of branchwidth
- Parameterized leaf power recognition via embedding into graph products
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Decomposition width of matroids
- Trees, grids, and MSO decidability: from graphs to matroids
- Monadic second-order model-checking on decomposable matroids
- Parameterized leaf power recognition via embedding into graph products
- Finding branch-decompositions of matroids, hypergraphs, and more
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Covering Vectors by Spaces: Regular Matroids
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Matroid tree-width
- A simpler self-reduction algorithm for matroid path-width
- The rank-width of edge-coloured graphs
- Finding branch-decompositions of matroids, hypergraphs, and more
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- scientific article; zbMATH DE number 1962824 (Why is no real title available?)
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Parameterized and Exact Computation
- First order convergence of matroids
- Tree automata and pigeonhole classes of matroids. II
- Branch-depth: generalizing tree-depth of graphs
- Tree automata and pigeonhole classes of matroids. I
- Directed Nowhere Dense Classes of Graphs
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 Q2490835)
