An adjustable linear time parallel algorithm for maximum weight bipartite matching

Authors:
Morteza Fayyazi;David Kaeli;Waleed Meleis
Affiliations:
Department of Electrical and Computer Engineering, Northeastern University, Boston, MA;Department of Electrical and Computer Engineering, Northeastern University, Boston, MA;Department of Electrical and Computer Engineering, Northeastern University, Boston, MA
Venue:
Information Processing Letters
Year:
2006

Citing 4
Cited 0

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

Information Processing Letters
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
An introduction to parallel algorithms

An introduction to parallel algorithms
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n/ω) using O(nmax(2ω,4+ω)) processing elements for ω ≥ 1. Parameter ω is not bounded. This is the fastest known strongly polynomial parallel algorithm to solve this problem. This is also the first adjustable parallel algorithm for the maximum weight bipartite matching problem in which the execution time can be reduced by an unbounded factor. We also present a general approach for finding efficient parallel algorithms for the maximum matching problem.