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
Sublinear-time parallel algorithms for matching and related problems
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Hi-index | 0.89 |
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n@w) using O(n^m^a^x^(^2^@w^,^4^+^@w^)) processing elements for @w=1. Parameter @w 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.