Decomposition width of matroids

DOI10.1016/j.dam.2011.03.016zbMath1241.05013OpenAlexW1966617477WikidataQ57601380 ScholiaQ57601380MaRDI QIDQ415290

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

matroidsalgorithmic metatheoremsbranch-widthmatroid algorithms

Mathematics Subject Classification ID

Related Items (3)

Tree automata and pigeonhole classes of matroids. I ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ Tree automata and pigeonhole classes of matroids. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monadic second-order model-checking on decomposable matroids
• Matroid tree-width
• Testing branch-width
• Addendum to matroid tree-width
• Tangles, tree-decompositions and grids in matroids
• Recognizing graphic matroids
• Branch-width and well-quasi-ordering in matroids and graphs.
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
• Branch-width, parse trees, and monadic second-order logic for matroids.
• On Rota's conjecture and excluded minors containing large projective geometries.
• 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
• Computing Representations of Matroids of Bounded Branch-Width
• Complexity of Finding Embeddings in a k-Tree
• Handbook of Graph Grammars and Computing by Graph Transformation
• A linear time algorithm for finding tree-decompositions of small treewidth
• Mathematical Foundations of Computer Science 2003
• A Parametrized Algorithm for Matroid Branch-Width
• The Tutte Polynomial for Matroids of Bounded Branch-Width
• On Matroid Representability and Minor Problems
• Finding Branch-Decompositions and Rank-Decompositions

This page was built for publication: Decomposition width of matroids