On certain classes of fractional matchings
From MaRDI portal
Publication:798265
DOI10.1016/0166-218X(84)90023-4zbMATH Open0545.90099MaRDI QIDQ798265FDOQ798265
Authors: J. R. Mühlbacher, F. X. Steinparz, Gottfried Tinhofer
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Fractional matroid matchings
- Publication:3199198
- Fractional matchings in hypergraphs
- Fractional Matchings of Graphs
- Fractional matchings and the Edmonds-Gallai theorem
- Stable fractional matchings
- Fractional and integer matchings in uniform hypergraphs
- Fractional and integer matchings in uniform hypergraphs
- A characterization of strongly stable fractional matchings
- The fractional matching numbers of graphs
Linear programming (90C05) Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (9)
- Structural analysis of a fractional matching problem
- Fractional matchings and the Edmonds-Gallai theorem
- On generalized matching problems
- A class of matchings and a related lattice
- On the use of optimal fractional matchings for solving the (integer) matching problem
- Kidney exchange: further utilization of donors via listed exchange
- On matroids induced by packing subgraphs
- Fractional perfect \(b\)-matching polytopes. I: General theory
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: On certain classes of fractional matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798265)