Distributed ( ∆ + 1 )-Coloring in Linear ( in ∆ ) Time

@inproceedings{Barenboim2009Distributed,
  title={Distributed ( ∆ + 1 )-Coloring in Linear ( in ∆ ) Time},
  author={Leonid Barenboim},
  year={2009}
}
The distributed (∆ + 1)-coloring problem is one of most fundamental and well-studied problems in Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there was a long line of gradually improving algorithms published. The current state-of-the-art running time is O(∆ log ∆+log∗ n), due to Kuhn and Wattenhofer, PODC’06. Linial (FOCS’87) has proved a lower bound of 1 2 log∗ n for the problem, and Szegedy and Vishwanathan (STOC’93) provided a heuristic argument that shows that… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 131 citations. REVIEW CITATIONS

2 Figures & Tables

Topics

Statistics

01020302009201020112012201320142015201620172018
Citations per Year

132 Citations

Semantic Scholar estimates that this publication has 132 citations based on the available data.

See our FAQ for additional information.