Highly Influenced

# Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds

@article{Kothapalli2006DistributedCI, title={Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, author={Kishore Kothapalli and Christian Scheideler and Melih Onus and Christian Schindelhauer}, journal={Proceedings 20th IEEE International Parallel & Distributed Processing Symposium}, year={2006}, pages={10 pp.-} }

- Published 2006 in Proceedings 20th IEEE International Parallelâ€¦
DOI:10.1109/IPDPS.2006.1639281

We consider the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color. It is trivial to see that every graph of maximum degree Delta can be colored with Delta + 1 colors, and distributed algorithms that find a (Delta + 1)-coloring in a logarithmic number of communication rounds, with high probability, are known since more than a decade. This is in general the best possible if only a constant number of bits can beâ€¦Â CONTINUE READING

Highly Cited

This paper has 34 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

22 Citations

26 References

Similar Papers