pith. sign in

arxiv: 1709.00901 · v1 · pith:G52HKY2Ynew · submitted 2017-09-04 · 💻 cs.DC · cs.DS

Distributed Colour Reduction Revisited

Jukka Kohonen , Janne H. Korhonen , Christopher Purcell , Jukka Suomela , Przemys{\l}aw Uzna\'nski This is my paper
classification 💻 cs.DC cs.DS
keywords algorithmdistributedcolourcolouringcoloursconsistentcyclesfast
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.