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}
}
  • Leonid Barenboim, M. Elkin
  • Published in STOC '09 2009
  • Computer Science, Mathematics
  • 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
    Deterministic distributed edge-coloring with fewer colors
    • 18
    • PDF
    Distributed deterministic edge coloring using bounded neighborhood independence
    • 15
    • PDF
    Distributed coloring algorithms for triangle-free graphs
    • 36
    • PDF
    Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks
    • 41
    Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth
    • 15
    • Highly Influenced
    • PDF
    Distributed deterministic edge coloring using bounded neighborhood independence
    • 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
    • 715
    • Highly Influential
    • PDF
    Locality in Distributed Graph Algorithms
    • 778
    • Highly Influential
    • PDF
    On the complexity of distributed graph coloring
    • 194
    • Highly Influential
    • PDF
    On the Complexity of Distributed Network Decomposition
    • 178
    • Highly Influential
    • PDF
    Locality based graph coloring
    • 84
    • Highly Influential
    Network decomposition and locality in distributed computation
    • 286
    • Highly Influential
    • PDF
    Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking
    • 403
    • Highly Influential
    • PDF
    Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems
    • 22
    • Highly Influential
    Distributive graph algorithms Global solutions from local data
    • 160
    • Highly Influential
    Parallel Symmetry-Breaking in Sparse Graphs
    • 163
    • Highly Influential
    • PDF