3 search results - page 1 / 1 » Coarse Grained Parallel Algorithms for Detecting Convex Bipa... |
WG
2000
Springer
13 years 10 months ago
2000
Springer
IPPS
1999
IEEE
13 years 10 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,...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...