Parallel algorithms for maximum bipartite matchings and maximum 0–1 flows
References (18)
- et al.
An improved parallel algorithm for maximal matching
Inform. Process. Lett.
(1986) - et al.
An O(n2 log n) parallel max flow algorithm
J. Algorithms
(1982) - et al.
An O(log n) parallel connectivity algorithm
J. Algorithms
(1982) Implementation of simultaneous memory address access in models that forbid it
J. Algorithms
(1983)- et al.
An O(n log n) sorting network
Combinatorca
(1983) An efficient network synchronization protocol
Graph Algorithms
(1979)- et al.
Network flow and testing graph connectivity
Siam J. Comput.
(1975) - et al.
Improved processor bounds for algebraic and combinatorial problems in RNC
There are more references available in the full text version of this article.
Cited by (2)
A distributed message-optimal assignment on rings
2019, Journal of Parallel and Distributed ComputingCitation Excerpt :Nevertheless, in both cases the time complexity can be simply measured as the number of time units needed to complete the algorithm’s execution. The interested reader can find useful references on these problems, their complexity, and related approximation issues in [1,2,12,18,21]. In this section we prove a lower bound on the message complexity of the problem that applies to both synchronous and asynchronous rings.
Distributed algorithm for a color assignment on asynchronous rings
2006, 20th International Parallel and Distributed Processing Symposium, IPDPS 2006
- ∗
Present affiliation: Department of Computer Science, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel 69978.
Copyright © 1989 Published by Elsevier Inc.