Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

24Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let G(V1, V2, E) be a bipartite graph and for each edge e ∈ E a weight We is prescribed. Then the bottleneck bipartite matching problem (BBMP) is to find a maximum cardinality matching M in G such that the largest edge weight associated with M is as small as possible. The best known algorithm to solve this problem has a worst-case complexity of O(m n log n), where m = |E| and n = |V1| + |V2|. In this note we present an O(m n log nm) algorithm to solve BBMP, improving the best available bound by a factor of O(m m log n)/n. © 1994.

Cite

CITATION STYLE

APA

Punnen, A. P., & Nair, K. P. K. (1994). Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem. Discrete Applied Mathematics, 55(1), 91–93. https://doi.org/10.1016/0166-218X(94)90039-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free