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.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence