## AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

## AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

# Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

FOCS, pp.919-930, (2020)

Cited by: 1|Views61
EI
Full Text
Bibtex

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:

Author
Jan van den Brand
Di Wang