An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs

DOI10.7561/SACS.2020.1.25OpenAlexW3081541876MaRDI QIDQ5089613

Shibsankar Das

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

zbMATH Keywords

bipartite graphcombinatorial optimizationstring matchingmaximum weight bipartite matchinglower bound for weights of bipartite matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs