http://dcg.ethz.ch/lectures/podc_allstars/
vertex coloring is used as a means to break symmetries, one of the main themes in distributed computing.
in distributed computing we are often happy with a solution
which is suboptimal. There is a tradeoff between the optimality of a
solution (efficacy), and the work/time needed to compute the solution
(efficiency).
Algorithm 1 Greedy Sequential
1: while there is an uncolored vertex v do
2: color v with the minimal color (number) that does not conflict with the
already colored neighbors
3: end while
Also check
Distributed Computing: A Locality-Sensitive Approach
vertex coloring is used as a means to break symmetries, one of the main themes in distributed computing.
in distributed computing we are often happy with a solution
which is suboptimal. There is a tradeoff between the optimality of a
solution (efficacy), and the work/time needed to compute the solution
(efficiency).
Algorithm 1 Greedy Sequential
1: while there is an uncolored vertex v do
2: color v with the minimal color (number) that does not conflict with the
already colored neighbors
3: end while
Distributed Computing: A Locality-Sensitive Approach