The generalized column incidence graph and a matroid base-listing algorithm

DOI10.1080/03081088608817702MaRDI QIDQ3744172zbMATH OpenOpenAlexFDO

Authors Mark S. Mummy

Publication date 1986

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081088608817702

zbMATH Keywords

algorithmgeneralized column incidence graphmatroid baseTutte polynomialWhitney polynomial

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Recommendations

• On the Complexity of Some Enumeration Problems for Matroids
• Full transversal matroids, strict gammoids, and the matroid components problem
• Finding all common bases in two matroids
• Algorithms and Computation
• On matroids and hierarchical graphs

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1792682 (Why is no real title available?)
• Matroid basis graphs. I
• On the Abstract Properties of Linear Dependence
• The dependence graph for bases in matroids
• Two algorithms for matroids

Cited in

(8)

• Incidence matrices, geometrical bases, combinatorial prebases and matroids
• Determining when a graphic matroid is transversal in linear time
• scientific article; zbMATH DE number 5533281 (Why is no real title available?)
• Full transversal matroids, strict gammoids, and the matroid components problem
• Strict matching matroids and matroid algorithms
• scientific article; zbMATH DE number 1405693 (Why is no real title available?)
• Output-sensitive algorithm for generating the flats of a matroid
• Algorithms and Computation

This page was built for publication: The generalized column incidence graph and a matroid base-listing algorithm

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