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

The problem of computing a maximum weight matching in a bipartite graph is one of the fundamental algorithmic problems that has played an important role in the development of combinatorial optimization and algorithmics. Let G_{w,σ} is a collection of all weighted bipartite graphs, each having σ and...

Full description

Bibliographic Details

Published in:	Scientific Annals of Computer Science
Main Author:	Shibsankar Das
Format:	Article
Language:	English
Published:	Alexandru Ioan Cuza University of Iasi 2020-08-01
Subjects:	bipartite graph maximum weight bipartite matching lower bound for weights of bipartite matching combinatorial optimization string matching
Online Access:	https://www.info.uaic.ro/en/sacs_articles/an-optimum-lower-bound-for-the-weights-of-maximum-weight-matching-in-bipartite-graphs/