Metraipolis › archive › dc_deb628b4718d

Diameter-Free Distributed Frequency Control for Graph Coloring in the CONGEST Model — arXiv:2608.02920

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.02920
License (as archived)
CC0-1.0
Archived
2026-10-31T12:32:02.156Z
SHA-256 of the archived text
0c0db77418273c471c3c55bf32fe092b2c65249e8da0d8eec57198383145d431
Stable URL of this page
https://metraipolis.com/documento/dc_deb628b4718d

How to cite

Diameter-Free Distributed Frequency Control for Graph Coloring in the CONGEST Model — arXiv:2608.02920 — arXiv (en), https://arxiv.org/abs/2608.02920 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_deb628b4718d (Metraipolis archive dc_deb628b4718d, sha256 0c0db77418273c471c3c55bf32fe092b2c65249e8da0d8eec57198383145d431)
BibTeX
@misc{dcdeb628b4718d,
  title = {Diameter-Free Distributed Frequency Control for Graph Coloring in the CONGEST Model — arXiv:2608.02920},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.02920},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_deb628b4718d; sha256 0c0db77418273c471c3c55bf32fe092b2c65249e8da0d8eec57198383145d431},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.02920. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper presents two randomized proper-coloring algorithms that control color frequencies in the synchronous CONGEST model without paying a diameter-dependent coordination cost. Let $\lambda \geq 1$ denote the desired failure exponent. For every fixed $\delta > 0$, the first algorithm uses $\chi = \lceil (2+\delta)\Delta \rceil$ colors and, with probability at least $1 - n^{-\lambda}$, outputs a proper coloring that bounds the deviation of every color frequency from $n/\chi$ by $O_\delta(\sqrt{(\lambda+1)(n/\chi)\lg n} + (\lambda+1)\lg n)$. Under an explicit load condition, this additive guarantee yields two-sided relative balance. The second algorithm works with every $\chi > \Delta$ and gives a one-sided frequency cap controlled by the palette slack $\chi - \Delta$. In particular, it uses $\Delta + \lceil (\Delta+1)/\lceil \ln n \rceil \rceil$ colors and caps every used color class by $O((\lambda+1)(\sigma \lg^2 n + \lg n))$, where $\sigma = n/(\Delta+1)$. Both algorithms run in $O((\lambda+1)\lg n)$ rounds, with no dependence on the network diameter; for the first algorithm, the multiplicative constant in the time bound depends on $\delta$.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-05 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.02920 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T12:18:40.932Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).