[ACM Press the twenty-fifth annual ACM s
โ
Kuhn, Fabian; Wattenhofer, Roger
๐
Article
๐
2006
๐
ACM Press
โ 193 KB
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 distributed setting. Processors of a distributed system are nodes of an undirected graph G. There is an edge between two no