← 研踪 PaperTrailarXiv:2608.02386 · v3
Greedy-Like Defective Coloring: Distributed Algorithms and Applications
首次提交 2026-08-03 23:29
版本更新 2026-11-07 00:35
雷达观测 2026-11-09 13:22
摘要
A -defective -coloring of a graph is a coloring of the nodes with colors such that every node has at most neighbors of the same color. Distributed algorithms for computing different variants of defective coloring are at the core of most deterministic state-of-the-art distributed coloring algorithms, and they are also an important tool in many other distributed graph algorithms. In several cases, the overall complexity could be improved if some version of defective coloring could be solved more efficiently. Barenboim and Elkin [STOC '09] introduced a two-pass greedy algorithm that uses colors with defect in rounds. This remains the best defect/color tradeoff for -time algorithms in bounded-degree graphs. This paper expands the capabilities of this two-pass algorithm. First, we generalize it to the \emph{list defective coloring} problem (Fuchs and Kuhn, [DISC '23]). Consequently, we obtain an alternative algorithm for computing a proper -coloring in rounds in the CONGEST model. Second, we analyze a generalized two-pass algorithm for standard defective colorings. We prove that if the number of colors is not a perfect square, we can improve the state-of-the-art defect for distributed -colorings by a constant factor in most cases. However, we also prove a limitation: for any , this generalized algorithm cannot achieve a -coloring with defect below .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v3 · 2026-11-07 00:35 · 最新观测版本
Greedy-Like Defective Coloring: Distributed Algorithms and Applications
A -defective -coloring of a graph is a coloring of the nodes with colors such that every node has at most neighbors of the same color. Distributed algorithms for computing different variants of defective coloring are at the core of most deterministic state-of-the-art distributed coloring algorithms, and they are also an important tool in many other distributed graph algorithms. In several cases, the overall complexity could be improved if some version of defective coloring could be solved more efficiently. Barenboim and Elkin [STOC '09] introduced a two-pass greedy algorithm that uses colors with defect in rounds. This remains the best defect/color tradeoff for -time algorithms in bounded-degree graphs. This paper expands the capabilities of this two-pass algorithm. First, we generalize it to the \emph{list defective coloring} problem (Fuchs and Kuhn, [DISC '23]). Consequently, we obtain an alternative algorithm for computing a proper -coloring in rounds in the CONGEST model. Second, we analyze a generalized two-pass algorithm for standard defective colorings. We prove that if the number of colors is not a perfect square, we can improve the state-of-the-art defect for distributed -colorings by a constant factor in most cases. However, we also prove a limitation: for any , this generalized algorithm cannot achieve a -coloring with defect below .
查看此版本解读 →查看此版本原文 ↗