Perfect matchings and extended polymatroid

DOI10.1007/s10559-008-9013-0zbMath1144.05053OpenAlexW2015524385MaRDI QIDQ946789

F. A. Sharifov

Publication date: 24 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-008-9013-0

zbMATH Keywords

bipartite graphperfect matchingextended polymatroid

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Perfect matching and polymatroids

Cites Work

• Selected topics on assignment problems
• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• Minimum cut problem using bases of extended polymatroids
• Signature Methods for the Assignment Problem

This page was built for publication: Perfect matchings and extended polymatroid