Distributed Colour Reduction Revisited
Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela,, Przemys{\l}aw Uzna\'nski
TL;DR
This paper presents a new, efficient distributed algorithm for graph coloring on paths and cycles that significantly reduces the number of colors in just three iterations without requiring global orientation.
Contribution
It introduces a simple, fast, and self-contained distributed coloring algorithm that reduces colors from an astronomically high number to three in three steps.
Findings
Reduces colors from 10^100 to 3 in three iterations
Does not require globally consistent orientation
Applicable to paths and cycles
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 to in three iterations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Computational Geometry and Mesh Generation