Coarse Grained Parallel Maximum Matching in Convex Bipartite Graphs

Abstract

We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = #A; B; E#.Forp processors with N=p memory per processor, N = jAj + jBj, N=p # p, the algorithm requires p ; log p# local computation, where n = jAj, m = jBj and T sequ #n; m# is the sequential time complexity for the problem. For the BSP model, this implies O#log p# supersteps log p# local computation