Distributed (delta+1)-coloring in linear (in delta) time

@inproceedings{Barenboim2009DistributedI,
  title={Distributed (delta+1)-coloring in linear (in delta) time},
  author={Leonid Barenboim and Michael Elkin},
  booktitle={STOC},
  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

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Locality in Distributed Graph Algorithms

  • SIAM J. Comput.
  • 1992
VIEW 29 EXCERPTS
HIGHLY INFLUENTIAL

Determinstic distributed algorithms for weak colorings

F. Kuhn
  • 2009
VIEW 17 EXCERPTS
HIGHLY INFLUENTIAL

Some simple distributed algorithms for sparse networks

  • Distributed Computing
  • 2001
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Locality based graph coloring

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Network decomposition and locality in distributed computation

  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Distributive graph algorithms Global solutions from local data

  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL