Sciweavers

2 search results - page 1 / 1
» Coarse Grained Parallel Maximum Matching In Convex Bipartite...
Sort
View
IPPS
1999
IEEE
13 years 8 months ago
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...