84 search results - page 8 / 17 » A Parallel Distance-2 Graph Coloring Algorithm for Distribut... |
PODC
2010
ACM
13 years 10 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
PODC
2010
ACM
13 years 10 months ago
2010
ACM
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
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,...
IPPS
1999
IEEE
13 years 11 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...