Strict matching matroids and matroid algorithms
From MaRDI portal
Publication:3744174
DOI10.1080/03081088608817718zbMATH Open0606.05017OpenAlexW1978795414WikidataQ126249411 ScholiaQ126249411MaRDI QIDQ3744174FDOQ3744174
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/03081088608817718
Recommendations
Cites Work
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- Title not available (Why is that?)
- Gammoids and transversal matroids
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- The dependence graph for bases in matroids
- A generalization of Tutte's 1-factor theorem to countable graphs
- Matchings in graphs. II
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- A CHARACTERIZATION OF STRICT MATCHING MATROIDS
- The generalized column incidence graph and a matroid base-listing algorithm
- Full transversal matroids, strict gammoids, and the matroid components problem
- A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH
Cited In (6)
This page was built for publication: Strict matching matroids and matroid algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744174)