Finding maximum matching for bipartite graphs in parallel

Finding maximum matching for bipartite graphs in parallel

0.00 Avg rating—0 Votes
Article ID: iaor19961005
Country: Netherlands
Volume: 16
Issue: 1
Start Page Number: 47
End Page Number: 49
Publication Date: Aug 1994
Journal: Operations Research Letters
Authors:
Keywords: matching
Abstract:

This paper shows that the maximum matching problem on bipartite graphs can be solved in O(n(loglogn)2) time with O(n3/loglogn) processors on a single instruction stream, multiple data stream computer that allows both read and write conflicts.

Reviews

Required fields are marked *. Your email address will not be published.