Perfect matching and polymatroids

DOI10.1007/s10559-017-9977-8zbMath1379.05092OpenAlexW2758082438MaRDI QIDQ681726

F. A. Sharifov

Publication date: 13 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-017-9977-8

zbMATH Keywords

perfect matchingextended polymatroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Perfect matchings and extended polymatroid
• Geometric algorithms and combinatorial optimization
• Estimating the supply chain efficiency loss when the seller has to estimate the buyer’s willingness to pay
• Perfectly matchable subgraph problem on a bipartite graph
• Unnamed Item

This page was built for publication: Perfect matching and polymatroids