Skip to content

Author

David Peleg

We have 2 of 7 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Distributed Near-Equitable Coloring in the LOCAL Model

For an $n$-vertex graph of maximum degree $\Delta$, an equitable $(\Delta+1)$-coloring is a proper coloring all of whose color classes have size $\sigma = n/(\Delta+1)$ up to rounding. Known algorithms for relaxations of this target aggregate along a spanning structure, at cost scaling with the diameter $D$. We study n...

Amit Nir, David Peleg · 1 citation
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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.