Parallel algorithms for maximum bipartite matchings and maximum 0–1 flows

https://doi.org/10.1016/0743-7315(89)90040-3Get rights and content

Abstract

Two parallel algorithms for finding maximum bipartite matchings on a CRCW PRAM are presented. The first algorithm finds a maximum bipartite matching in O(n log n) time using m processors, where n is the number of vertices and m is the number of edges in the bipartite graph. The second algorithm does the same job in O(n) time using nm processors. Simple modifications of these algorithms induce parallel algorithms for finding maximum 0–1 flows, which are also presented.

References (18)

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 Computing
    Citation 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.

View full text