2 search results - page 1 / 1 » Coarse Grained Parallel Maximum Matching In Convex Bipartite... |
176
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
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,...
176
Voted
WG
2000
Springer
15 years 10 months ago
2000
Springer
