Login / Signup
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.
Jan van den Brand
Yin Tat Lee
Danupon Nanongkai
Richard Peng
Thatchaphol Saranurak
Aaron Sidford
Zhao Song
Di Wang
Published in:
CoRR (2020)
Keyphrases
</>
bipartite matching
maximum weight
minimum cost flow
bipartite graph
weighted graph
worst case
graph mining
graph model
densely connected
quasi cliques
directed graph
graph theory
shortest path