23 search results - page 1 / 5 » Coarse Grained Parallel Graph Planarity Testing |
PDPTA
2000
13 years 8 months ago
2000
PPSC
1997
13 years 8 months ago
1997
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...
IPPS
1999
IEEE
13 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,...
WG
2000
Springer
13 years 10 months ago
2000
Springer
EUROPAR
2004
Springer
14 years 10 days ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...