Computing Representations of Matroids of Bounded Branch-Width

DOI10.1007/978-3-540-70918-3_20MaRDI QIDQ3590936zbMATH OpenOpenAlexFDO

Authors Daniel Král'

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_20

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• A Parametrized Algorithm for Matroid Branch-Width
• Decomposition width of matroids
• Decomposition width of matroids
• On Matroid Representability and Minor Problems
• Combinatorial generation of matroid representations: theory and practice

Cited in

(10)

• Combinatorial generation of matroid representations: theory and practice
• Amalgam width of matroids
• Outerplanar obstructions for matroid pathwidth
• On Matroid Representability and Minor Problems
• scientific article; zbMATH DE number 2157324 (Why is no real title available?)
• Decomposition width of matroids
• The extremal functions of classes of matroids of bounded branch-width
• Finding branch-decompositions of matroids, hypergraphs, and more
• First order convergence of matroids
• Outerplanar obstructions for matroid pathwidth

This page was built for publication: Computing Representations of Matroids of Bounded Branch-Width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590936)