# On the complexity of distributed graph coloring

@inproceedings{Kuhn2006OnTC, title={On the complexity of distributed graph coloring}, author={F. Kuhn and Roger Wattenhofer}, booktitle={PODC '06}, year={2006} }

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 <i>G</i>. There is an edge between two nodes whenever the corresponding processors can directly communicate with each other. We assume that distributed coloring algorithms start with an initial <i>m</i>-coloring of <i>G</i>. In the… CONTINUE READING

193 Citations

Deterministic Distributed Vertex Coloring in Polylogarithmic Time

- Mathematics, Computer Science
- 2011

13

On the complexity of distributed graph coloring with local minimality constraints

- Computer Science
- 2009

18

Distributed deterministic edge coloring using bounded neighborhood independence

- Computer Science
- 2011

15

#### References

##### Publications referenced by this paper.

SHOWING 1-3 OF 3 REFERENCES