Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- 1 October 1994
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 55 (1) , 91-93
- https://doi.org/10.1016/0166-218x(94)90039-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Solving linear bottleneck assignment problems via strong spanning treesOperations Research Letters, 1992
- Computing a maximum cardinality matching in a bipartite graph in time O(n1.5
m log n Information Processing Letters, 1991 - Algorithms for two bottleneck optimization problemsJournal of Algorithms, 1988
- An augmenting path method for solving Linear Bottleneck Assignment problemsComputing, 1978