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

DOI10.1080/03081088608817708zbMath0606.05016OpenAlexW2033912868WikidataQ126249496 ScholiaQ126249496MaRDI QIDQ3744173

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

algorithmsGaussian eliminationTutte polynomialdirected pathstransversal matroiddependence graphsWhitney polynomialstrict gammoid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Strict matching matroids and matroid algorithms

Cites Work

• Unnamed Item
• Matchings in graphs. II
• The dependence graph for bases in matroids
• Gammoids and transversal matroids
• Complexity of Combinatorial Algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

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