Finding maximum matching for bipartite graphs in parallel

Authors:
Pranay Chaudhuri
Affiliations:
Department of Electrical and Computer Engineering, Kuwait University, PO Box 5969, Safat, Kuwait
Venue:
Operations Research Letters
Year:
1994

Citing 5
Cited 0

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

Information Processing Letters
Fast parallel graph searching with applications

BIT
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
Parallel algorithms: design and analysis

Parallel algorithms: design and analysis
Graph Algorithms

Graph Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that the maximum matching problem on biparrtite graphs can be solved in O(n(log logn)^2) time with PO(n^3/log log n) processors on a single instruction stream, multiple data stream (SIMD) computer that allows both read and write conflicts.