Parallel algorithms for maximum bipartite matchings and maximum 0-1 flows
Journal Article
·
· Journal of Parallel and Distributed Computing; (USA)
- Dept. of Computer Science, Technion-Israel Institute of Technology, Haifa (IL)
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.
- OSTI ID:
- 5213761
- Journal Information:
- Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 6:1; ISSN JPDCE; ISSN 0743-7315
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel matching algorithm for convex bipartite graphs and applications to scheduling
Valiant's maximum algorithm with sequential memory accesses. Technical report
Multithreaded Algorithms for Maximum Matching in Bipartite Graphs
Journal Article
·
Wed Oct 31 23:00:00 EST 1984
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6593491
Valiant's maximum algorithm with sequential memory accesses. Technical report
Technical Report
·
Thu Mar 31 23:00:00 EST 1988
·
OSTI ID:6265203
Multithreaded Algorithms for Maximum Matching in Bipartite Graphs
Conference
·
Thu May 31 00:00:00 EDT 2012
·
OSTI ID:1053377