Technical Report CS0352

TR#:CS0352
Class:CS
Title: Parallel Algorithm for Finding Maximum Bipartite Matching and Maximum Flow in 0-1 Networks
Authors: E. Schieber and S. Moran
PDFCS0352.pdf
Abstract: Two parallel algorithms for finding a maximum matching in bipartite graphs are presented. The first finds a maximum matching using O(|E|) processors with time complexity of O(|V|log|V|), while the second does the same job using O(|V||E|) processors in O(|V|) time. Simple modifications of these algorithms induce parallel algorithms for finding maximum 0-1 flows, which are also presented.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1985/CS/CS0352), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1985
To the main CS technical reports page

Computer science department, Technion
admin