International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)
A Better Practical Algorithm for Distributed Graph Coloring
Warsaw, Poland
September 22-September 25
ISBN: 0-7695-1730-7
In the paper we present a new distributed algorithm for coloring the vertices of a graph. A practical simulation shows that this algorithmperforms much better then a naive distributed algorithm.
Citation:
Marek Kubale, łukasz Kuszner, "A Better Practical Algorithm for Distributed Graph Coloring," parelec, pp.72, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002