An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
DOI10.7561/SACS.2020.1.25OpenAlexW3081541876MaRDI QIDQ5089613FDOQ5089613
Publication date: 19 July 2022
Published in: Scientific Annals of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00406
Recommendations
- Optimum matchings in weighted bipartite graphs
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- Maximum matching of given weight in complete and complete bipartite graphs
- Maximum weight induced matching in some subclasses of bipartite graphs
- A scaling algorithm for maximum weight matching in bipartite graphs
- Matchings in node-weighted convex bipartite graphs
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph
- A decomposition theorem for maximum weight bipartite matchings
- scientific article; zbMATH DE number 7559248
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
combinatorial optimizationbipartite graphstring matchingmaximum weight bipartite matchinglower bound for weights of bipartite matching
Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (6)
- Optimum matchings in weighted bipartite graphs
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Title not available (Why is that?)
- Maximum matching of given weight in complete and complete bipartite graphs
- A combinatorial algorithm for weighted stable sets in bipartite graphs
- A decomposition theorem for maximum weight bipartite matchings
This page was built for publication: An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089613)
