774 search results - page 36 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
83
Voted
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
DAM
2010
14 years 7 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
119
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
86
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...