Simple distributed ∆ + 1-coloring of graphs

  title={Simple distributed ∆ + 1-coloring of graphs},
  author={{\"O}jvind Johansson},
A very natural randomized algorithm for distributed vertex coloring of graphs is analyzed. Under the assumption that the random choices of processors are mutually independent, the execution time will be O ( ogn) rounds almost always. A small modification of the algorithm is also proposed.  1999 Elsevier Science B.V. All rights reserved. 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 112 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 66 extracted citations

112 Citations

Citations per Year
Semantic Scholar estimates that this publication has 112 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…