Maximum semi-matching problem in bipartite graphs
From MaRDI portal
Publication:2857031
DOI10.7151/dmgt.1694zbMath1275.05045OpenAlexW2801207912MaRDI QIDQ2857031
Gabriel Semanisin, Ján Katrenič
Publication date: 31 October 2013
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1694
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
On computing an optimal semi-matching ⋮ Distributed backup placement in networks ⋮ Decreasing minimization on M-convex sets: background and structures ⋮ Decreasing minimization on M-convex sets: algorithms and applications
This page was built for publication: Maximum semi-matching problem in bipartite graphs
