Optimal (degree+1)-Coloring in Congested Clique
(2023)
Presentation / Conference Contribution
Coy, S., Czumaj, A., Davies, P., & Mishra, G. (2023, July). Optimal (degree+1)-Coloring in Congested Clique. Presented at ICALP 2023: 50th EATCS International Colloquium on Automata, Languages and Programming, Paderborn, Germany
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 find a proper coloring using these color palettes. The (degree+1)-list co... Read More about Optimal (degree+1)-Coloring in Congested Clique.