# Distributed (δ+1)-coloring in linear (in δ) time

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

131 Citations

(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting

- Computer Science, Mathematics
- 2015

- 42
- PDF

Distributed deterministic edge coloring using bounded neighborhood independence

- Computer Science
- 2011

- 15
- PDF

Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models

- Computer Science
- 2018

- 26
- PDF

Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks

- Computer Science, Mathematics
- 2016

- 41

Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth

- Mathematics, Computer Science
- 2011

- 15
- Highly Influenced
- PDF

Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks

- Computer Science
- 2015

- 39

Distributed deterministic edge coloring using bounded neighborhood independence

- Engineering, Computer Science
- 2011

- 27
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 16 REFERENCES

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem

- Mathematics, Computer Science
- 1986

- 715
- Highly Influential
- PDF

On the complexity of distributed graph coloring

- Mathematics, Computer Science
- 2006

- 194
- Highly Influential
- PDF

On the Complexity of Distributed Network Decomposition

- Mathematics, Computer Science
- 1996

- 178
- Highly Influential
- PDF

Network decomposition and locality in distributed computation

- Computer Science
- 1989

- 286
- Highly Influential
- PDF

Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking

- Computer Science
- 1986

- 403
- Highly Influential
- PDF

Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems

- Mathematics
- 1987

- 22
- Highly Influential

Distributive graph algorithms Global solutions from local data

- Mathematics, Computer Science
- 1987

- 160
- Highly Influential

Parallel Symmetry-Breaking in Sparse Graphs

- Mathematics, Computer Science
- 1988

- 163
- Highly Influential
- PDF