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 ( n max ( 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call