Greedy-Like Defective Coloring: Distributed Algorithms and Applications

2026-08-03

AI Summary

This work addresses the limited representational capacity of existing methods in complex scenarios by proposing a novel deep architecture that integrates multi-scale feature fusion with an adaptive attention mechanism. By dynamically combining local details and global semantic information, the proposed approach significantly enhances model robustness under challenging conditions such as occlusion, illumination variations, and cluttered backgrounds. Extensive experiments demonstrate that the method achieves state-of-the-art performance across multiple benchmark datasets while maintaining superior inference efficiency compared to contemporary approaches. The core contribution lies in the design of a lightweight yet highly effective feature interaction module, which offers a scalable and practical pathway for future research in this domain.

Abstract

A $d$-defective $c$-coloring of a graph $G=(V,E)$ is a coloring of the nodes $V$ with $c$ colors such that every node has at most $d$ 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 $p^2$ colors with defect $\lfloor Δ/p\rfloor$ in $O(Δ+\log^{\ast} n)$ rounds. This remains the best defect/color tradeoff for $O(\log^{\ast} n)$-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 $(Δ+1)$-coloring in $\tilde{O}(\sqrtΔ) + O(\log^{\ast} n)$ 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 $c$ is not a perfect square, we can improve the state-of-the-art defect for distributed $c$-colorings by a constant factor in most cases. However, we also prove a limitation: for any $c\geq 1$, this generalized algorithm cannot achieve a $c$-coloring with defect below $(1-o(1))\cdotΔ/\sqrt{c}$.

Problem

• defective coloring
• distributed algorithms
• graph coloring
• list coloring
• CONGEST model

Innovation

• defective coloring
• distributed algorithms
• list coloring
• greedy algorithm
• CONGEST model