Login / Signup

Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).

Helmut AltNorbert BlumKurt MehlhornMarkus Paul
Published in: Inf. Process. Lett. (1991)
Keyphrases
  • maximum cardinality
  • bipartite graph
  • maximum matching
  • worst case
  • lower bound
  • minimum weight
  • link prediction
  • endpoints
  • upper bound
  • bipartite graph matching
  • objective function