Parallel derandomization for coloring
S Coy, A Czumaj, P Davies-Peck… - Proceedings of the 2024 …, 2024 - dl.acm.org
Graph coloring problems are among the most fundamental problems in parallel and
distributed computing, and have been studied extensively in both settings. In this context …
distributed computing, and have been studied extensively in both settings. In this context …
Optimal (degree+ 1)-Coloring in Congested Clique
We consider the distributed complexity of the (degree+ 1)-list coloring problem, in which
each node $ u $ of degree $ d (u) $ is assigned a palette of $ d (u)+ 1$ colors, and the goal …
each node $ u $ of degree $ d (u) $ is assigned a palette of $ d (u)+ 1$ colors, and the goal …