Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering

Authors:
  • YCYi-Jun Chang
    Yi-Jun Chang
  • WLWenzheng Li
    Wenzheng Li
  • SPSeth Pettie
    Seth Pettie

Abstract
Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper, we present a new algorithm for $(\Delta+1)$-list coloring in the randomized ${LOCAL...
Funding Information
  • National Science Foundation (CCF-1514383, CCF-1637546, CCF-1815316)

This publication has 43 references indexed in Scilit: