210 search results - page 12 / 42 » A Scalable Parallel Graph Coloring Algorithm for Distributed... |
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
SPDP
1991
IEEE
14 years 9 days ago
1991
IEEE
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
PODC
2010
ACM
14 years 20 days 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...
EUROPAR
2001
Springer
14 years 1 months ago
2001
Springer
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large nu...
IPPS
1999
IEEE
14 years 1 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...