105 search results - page 2 / 21 » An experimental study of a simple, distributed edge coloring... |
JCP
2007
13 years 5 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
SPAA
2009
ACM
14 years 2 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
EUROPAR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
MST
2010
13 years 3 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...