An O(n log n) algorithm for the convex bipartite matching problem
- 30 April 1984
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 3 (1) , 31-34
- https://doi.org/10.1016/0167-6377(84)90068-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problemsActa Informatica, 1981
- Route Constrained Fleet SchedulingTransportation Science, 1976
- Maximum matching in a convex bipartite graphNaval Research Logistics Quarterly, 1967