Simple, deterministic, constant-round coloring in the congested clique

A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020), Association for Computing Machinery, n.d.

Download
No fulltext has been uploaded. References only!
Conference Paper | Accepted | English
Author
Czumaj, Artur ; Davies, PeterIST Austria ; Parter, Merav
Department
Abstract
We settle the complexity of the $(\Delta+1)$-coloring and $(\Delta+1)$-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round $(\Delta+1)$-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art deterministic bounds of $O(\log \Delta)$ rounds for $(\Delta+1)$-coloring and $O(\log^3 \Delta)$ rounds for $(\Delta+1)$-list coloring. A remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after $O(1)$ recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in $n$, the number of nodes in the input graph) space. We also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic $(\Delta+1)$-list coloring algorithm designed for sublinear-space MPC, which runs in $O(\log \Delta + \log\log n)$ rounds.
Publishing Year
Date Published
2020-05-05
Proceedings Title
Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020)
Conference
PODC: Symposium on Principles of Distributed Computing
Conference Location
Salerno, Italy
Conference Date
2020-08-03 – 2020-08-07
IST-REx-ID

Cite this

Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020). Association for Computing Machinery.
Czumaj, A., Davies, P., & Parter, M. (n.d.). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020). Salerno, Italy: Association for Computing Machinery.
Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020). Association for Computing Machinery, n.d.
A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020), Salerno, Italy.
Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020). PODC: Symposium on Principles of Distributed Computing
Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (PODC 2020), Association for Computing Machinery.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar