All your bases are belong to us: listing all bases of a matroid by greedy exchanges

DOI10.4230/LIPICS.FUN.2022.22MaRDI QIDQ6540592FDOQ6540592

Arturo I. Merino, Aaron Williams, Torsten Mütze

Publication date: 16 May 2024

zbMATH Keywords

spanning treesgreedy algorithmsmatroidsgray codesbase exchangecombinatorial generation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (4)

• On the hardness of Gray code problems for combinatorial objects
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• Traversing combinatorial 0/1-polytopes via optimization
• Generating signed permutations by twisting two-sided ribbons

This page was built for publication: All your bases are belong to us: listing all bases of a matroid by greedy exchanges

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