An adjustable linear time parallel algorithm for maximum weight bipartite matching

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

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Morteza Fayyazi, David R. Kaeli, Waleed Meleis
• Keywords: Adjustable Time Complexity, IPL 2006, Maximum Weight, Parallel Algorithm