Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

Cited by: 0|Bibtex|Views6|Links

Abstract:

We present an $\tilde O(m+n^{1.5})$-time randomized algorithm for maximum cardinality bipartite matching and related problems (e.g. transshipment, negative-weight shortest paths, and optimal transport) on $m$-edge, $n$-node graphs. For maximum cardinality bipartite matching on moderately dense graphs, i.e. $m = \Omega(n^{1.5})$, our alg...More

Code:

Data:

Your rating :
0

 

Tags
Comments