Login / Signup

Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem.

Abraham P. PunnenKunhiraman Nair
Published in: Discret. Appl. Math. (1994)
Keyphrases
  • bipartite matching
  • maximum cardinality
  • worst case
  • bipartite graph
  • upper bound
  • maximum weight
  • computational complexity
  • minimum cost flow
  • relational databases
  • greedy algorithm
  • minimum weight