Parallel and on-line graph coloring
MM Halldórsson - Journal of Algorithms, 1997 - Elsevier
We discover a surprising connection between graph coloring in two orthogonal paradigms:
parallel and on-line computing. We present a randomized on-line coloring algorithm with a
performance ratio ofO (n/logn), an improvement oflog n factor over the previous best known
algorithm of Vishwanathan. Also, from the same principles, we construct a parallel coloring
algorithm with the same performance ratio, for the first such result. As a byproduct, we obtain
a parallel approximation for the independent set problem.
parallel and on-line computing. We present a randomized on-line coloring algorithm with a
performance ratio ofO (n/logn), an improvement oflog n factor over the previous best known
algorithm of Vishwanathan. Also, from the same principles, we construct a parallel coloring
algorithm with the same performance ratio, for the first such result. As a byproduct, we obtain
a parallel approximation for the independent set problem.