Work

Simple, Deterministic, Constant-Round Coloring in the Congested Clique

Year: 2020

Type: conference-paper

Abstract: We settle the complexity of the (Δ + 1)-coloring and (Δ + 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 (Δ + 1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(log Δ)-round deterministic (Δ + 1)-coloring bound of Parter (ICALP'18).

DOI: 10.1145/3382734.3405751

Authors: Artur Czumaj, Peter Davies, Merav Parter

Institutions: University of Warwick, Institute of Science and Technology Austria, Weizmann Institute of Science

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Engineering and Physical Sciences Research Council, Horizon 2020

Awards: G3046054759, G7516577047, Sublinear Algorithms for Big Graphs

OpenAlex ID: W3022417154

FWCI: 3.501

Cites: 13

Cited by: 17

Related to: