9 citations · 17 across the 7 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016★ 2 cited
Experimental Evaluation of Modified Decomposition Algorithm for Maximum Weight Bipartite Matching
Shibsankar Das
Let be an undirected bipartite graph with positive integer weights on the edges. We refine the existing decomposition theorem originally proposed by Kao et al., for computing m…
cs.DM2016★ 3 cited
A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
Shibsankar Das
Let $\Ga$ be the collection of all weighted bipartite graphs each having and , as the size of a vertex partition and the total weight, respectively. We give a tight lower bo…