Distributed Colour Reduction Revisited

Jukka Kohonen; Janne H. Korhonen; Christopher Purcell; Jukka Suomela; Przemysław Uznański

Distributed Colour Reduction Revisited

Distributed, Parallel, and Cluster Computing 2017-09-05 v1 Data Structures and Algorithms

Authors: Jukka Kohonen , Janne H. Korhonen , Christopher Purcell , Jukka Suomela , Przemysław Uznański

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.

Distributed Colour Reduction Revisited

Abstract

Keywords

Cite

Related papers