Strict matching matroids and matroid algorithms
From MaRDI portal
Publication:3744174
Recommendations
Cites work
- A CHARACTERIZATION OF STRICT MATCHING MATROIDS
- A generalization of Tutte's 1-factor theorem to countable graphs
- A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Full transversal matroids, strict gammoids, and the matroid components problem
- Gammoids and transversal matroids
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- Matchings in graphs. II
- Paths, Trees, and Flowers
- The dependence graph for bases in matroids
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- The generalized column incidence graph and a matroid base-listing algorithm
Cited in
(7)- Structural properties of matroid matchings
- Matroid matching with Dilworth truncation
- Matroid matching: the power of local search
- Matching as the Intersection of Matroids
- Full transversal matroids, strict gammoids, and the matroid components problem
- A CHARACTERIZATION OF STRICT MATCHING MATROIDS
- A Characterisation of Strict Matching Matroids
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)