Full transversal matroids, strict gammoids, and the matroid components problem

DOI10.1080/03081088608817708MaRDI QIDQ3744173zbMATH OpenOpenAlexWikidataFDO

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/03081088608817708

zbMATH Keywords

algorithmsdependence graphsdirected pathsGaussian eliminationstrict gammoidtransversal matroidTutte polynomialWhitney polynomial

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Strict matching matroids and matroid algorithms
• The generalized column incidence graph and a matroid base-listing algorithm
• Linear representation of transversal matroids and gammoids parameterized by rank
• Linear representation of transversal matroids and gammoids parameterized by rank
• scientific article; zbMATH DE number 4025457

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Complexity of Combinatorial Algorithms
• Gammoids and transversal matroids
• scientific article; zbMATH DE number 1792682 (Why is no real title available?)
• Matchings in graphs. II
• The dependence graph for bases in matroids

Cited in

(6)

• On finding some new excluded minors for gammoids
• Undirected strict gammoids
• The generalized column incidence graph and a matroid base-listing algorithm
• Strict matching matroids and matroid algorithms
• Linear representation of transversal matroids and gammoids parameterized by rank
• Linear representation of transversal matroids and gammoids parameterized by rank

This page was built for publication: Full transversal matroids, strict gammoids, and the matroid components problem

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