Combinatorial generation of matroid representations: theory and practice

MaRDI QIDQ3410102zbMATH OpenFDO

Authors Petr Hliněný

Publication date 21 November 2006

zbMATH Keywords

matroid generation algorithm

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Equivalence-free exhaustive generation of matroid representations
• scientific article; zbMATH DE number 2076917
• scientific article; zbMATH DE number 56949
• Computing Representations of Matroids of Bounded Branch-Width
• Publication:3484842

Cited in

(12)

• Combinatorial representations
• Equivalence-free exhaustive generation of matroid representations
• scientific article; zbMATH DE number 4156447 (Why is no real title available?)
• Computing Representations of Matroids of Bounded Branch-Width
• Gröbner representations of binary matroids
• scientific article; zbMATH DE number 56949 (Why is no real title available?)
• scientific article; zbMATH DE number 2076917 (Why is no real title available?)
• scientific article; zbMATH DE number 2157324 (Why is no real title available?)
• On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture
• Output-sensitive algorithm for generating the flats of a matroid
• Matroid enumeration for incidence geometry
• On the number of representations of matroids over finite fields

This page was built for publication: Combinatorial generation of matroid representations: theory and practice

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