Login / Signup

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

Jan van den BrandYin Tat LeeDanupon NanongkaiRichard PengThatchaphol SaranurakAaron SidfordZhao SongDi Wang
Published in: FOCS (2020)
Keyphrases
  • bipartite matching
  • maximum weight
  • minimum cost flow
  • worst case
  • directed graph
  • graph model
  • genetic algorithm
  • graph theory
  • weighted graph
  • bipartite graph
  • minimum weight
  • densely connected
  • quasi cliques