论文信息 - Distributed Colour Reduction Revisited

Distributed Colour Reduction Revisited

We give a new, simple distributed algorithm for graph colouring in paths and cycles. Our algorithm is fast and self-contained, it does not need any globally consistent orientation, and it reduces the number of colours from $10^{100}$ to $3$ in three iterations.

Christopher Purcell | Przemyslaw Uznanski | Jukka Suomela | Janne H. Korhonen | Jukka Kohonen

[1] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[2] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[3] Roger Wattenhofer,et al. On the complexity of distributed graph coloring , 2006, PODC '06.

[4] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .

[5] M. Kaufmann. What Can Be Computed Locally ? , 2003 .

[6] Leonid Barenboim,et al. Distributed Graph Coloring: Fundamentals and Recent Developments , 2013, Distributed Graph Coloring: Fundamentals and Recent Developments.

[7] Jukka Suomela,et al. Exact Bounds for Distributed Graph Colouring , 2015, SIROCCO.

[8] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .