Decomposition width of matroids

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

zbMATH Keywords

algorithmic metatheoremsmatroidsbranch-widthmatroid algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Decomposition width of matroids
• A Parametrized Algorithm for Matroid Branch-Width
• Monadic second-order model-checking on decomposable matroids
• Amalgam width of matroids
• Deciding first order properties of matroids

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 4081531 (Why is no real title available?)
• scientific article; zbMATH DE number 53949 (Why is no real title available?)
• scientific article; zbMATH DE number 1962824 (Why is no real title available?)
• A Parametrized Algorithm for Matroid Branch-Width
• A linear time algorithm for finding tree-decompositions of small treewidth
• Addendum to matroid tree-width
• Approximating clique-width and branch-width
• Branch-width and well-quasi-ordering in matroids and graphs.
• Branch-width, parse trees, and monadic second-order logic for matroids.
• Complexity of Finding Embeddings in a k-Tree
• Computing Representations of Matroids of Bounded Branch-Width
• Easy problems for tree-decomposable graphs
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
• Finding Branch-Decompositions and Rank-Decompositions
• Handbook of Graph Grammars and Computing by Graph Transformation
• Mathematical Foundations of Computer Science 2003
• Matroid tree-width
• Monadic second-order model-checking on decomposable matroids
• On Matroid Representability and Minor Problems
• On Rota's conjecture and excluded minors containing large projective geometries.
• Recognizing graphic matroids
• Tangles, tree-decompositions and grids in matroids
• Testing branch-width
• The Tutte Polynomial for Matroids of Bounded Branch-Width
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(11)

• Amalgam width of matroids
• Monadic second-order model-checking on decomposable matroids
• Covering Vectors by Spaces: Regular Matroids
• Decomposition width of matroids
• Computing Representations of Matroids of Bounded Branch-Width
• Mathematical Foundations of Computer Science 2003
• Deciding first order properties of matroids
• A simpler self-reduction algorithm for matroid path-width
• Parameterized and Exact Computation
• Tree automata and pigeonhole classes of matroids. II
• Tree automata and pigeonhole classes of matroids. I

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)