Preprint
Aug 2026
Distributed Algorithms for Near-Equitable Coloring
A suite of fast randomized distributed algorithms representing varying points on this tradeoff are presented, analyze their properties, and study their time complexity in the sequential, CONGEST and Congested Clique models.
Amit Nir, David Peleg
· 1 citation