A parallel matching algorithm for convex bipartite graphs and applications to scheduling
- 1 November 1984
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 1 (2) , 185-205
- https://doi.org/10.1016/0743-7315(84)90004-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Binary Trees and Parallel Scheduling AlgorithmsIEEE Transactions on Computers, 1983
- Parallel Scheduling AlgorithmsOperations Research, 1983
- Parallel Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981
- Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problemsActa Informatica, 1981
- Bitonic Sort on a Mesh-Connected Parallel ComputerIEEE Transactions on Computers, 1979
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Optimal Preemptive Scheduling on Two-Processor SystemsIEEE Transactions on Computers, 1969
- Maximum matching in a convex bipartite graphNaval Research Logistics Quarterly, 1967
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959