Optimal (degree+1)-Coloring in Congested Clique

Sam Coy, Artur Czumaj, Peter Davies +1

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 is to…