Decomposition width of matroids
From MaRDI portal
Publication:415290
DOI10.1016/J.DAM.2011.03.016zbMATH Open1241.05013OpenAlexW1966617477WikidataQ57601380 ScholiaQ57601380MaRDI QIDQ415290FDOQ415290
Authors: Daniel Král' 
Publication date: 11 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.016
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- Approximating clique-width and branch-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Easy problems for tree-decomposable graphs
- Complexity of Finding Embeddings in a k-Tree
- A linear time algorithm for finding tree-decompositions of small treewidth
- Handbook of Graph Grammars and Computing by Graph Transformation
- Recognizing graphic matroids
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Computing Representations of Matroids of Bounded Branch-Width
- A Parametrized Algorithm for Matroid Branch-Width
- On Matroid Representability and Minor Problems
- Testing branch-width
- Matroid tree-width
- Title not available (Why is that?)
- Finding Branch-Decompositions and Rank-Decompositions
- Tangles, tree-decompositions and grids in matroids
- Branch-width and well-quasi-ordering in matroids and graphs.
- On Rota's conjecture and excluded minors containing large projective geometries.
- The Tutte Polynomial for Matroids of Bounded Branch-Width
- Addendum to matroid tree-width
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2003
- Monadic second-order model-checking on decomposable matroids
Cited In (10)
- Decomposition width of matroids
- Mathematical Foundations of Computer Science 2003
- Monadic second-order model-checking on decomposable matroids
- Computing Representations of Matroids of Bounded Branch-Width
- Tree automata and pigeonhole classes of matroids. II
- Tree automata and pigeonhole classes of matroids. I
- Parameterized and Exact Computation
- Amalgam width of matroids
- Covering Vectors by Spaces: Regular Matroids
- Deciding first order properties of matroids
This page was built for publication: Decomposition width of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415290)
