Combinatorial generation of matroid representations: theory and practice

zbMATH Open1107.05024MaRDI QIDQ3410102FDOQ3410102

Authors: Petr Hliněný 

Publication date: 21 November 2006

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

zbMATH Keywords

matroid generation algorithm

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (11)

• Matroid enumeration for incidence geometry
• Title not available (Why is that?)
• Computing Representations of Matroids of Bounded Branch-Width
• 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
• Gröbner representations of binary matroids
• Equivalence-free exhaustive generation of matroid representations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial representations
• Title not available (Why is that?)

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)