Local冲突着色再探:列表的线性化
Local Conflict Coloring Revisited: Linial for Lists
摘要:
Linial的著名的颜色约简算法将具有最大度$Δ$的图的给定$m$ -着色在单轮中约简为$O(Δ^2\log m)$ -着色。当节点被限制为从允许的颜色列表中选择颜色时,我们给出了类似的结果:给定$m$ -着色在最大出度$β$的有向图中,如果每个节点都有一个来自颜色空间$\mathcal{C}$的大小为$Ω(β^2 (\log β+\log\log m + \log \log |\mathcal{C}|))$的列表,那么他们可以在两轮中选择颜色。此外,节点的通信基本上包括将其列表发送给邻居。这是作为框架的一部分获得的,该框架还包含Linial的颜色减少(具有替代证明)作为特例。我们的结果也导致了一个有缺陷的列表着色算法。作为推论,我们改进了Barenboim等人[PODC'18]的最先进的真正本地$(deg+1)$ -列表着色算法,将运行时间略微减少到$O(\sqrt{Δ\logΔ})+\log^* n$,并显著减少消息大小(从巨大到大致$Δ$)。我们的技术受到Fraigniaud等人[FOCS'16]的局部冲突着色框架的启发。
英文摘要:
Linial's famous color reduction algorithm reduces a given $m$-coloring of a graph with maximum degree $Δ$ to a $O(Δ^2\log m)$-coloring, in a single round in the LOCAL model. We show a similar result when nodes are restricted to choose their color from a list of allowed colors: given an $m$-coloring in a directed graph of maximum outdegree $β$, if every node has a list of size $Ω(β^2 (\log β+\log\log m + \log \log |\mathcal{C}|))$ from a color space $\mathcal{C}$ then they can select a color in two rounds in the LOCAL model. Moreover, the communication of a node essentially consists of sending its list to the neighbors. This is obtained as part of a framework that also contains Linial's color reduction (with an alternative proof) as a special case. Our result also leads to a defective list coloring algorithm. As a corollary, we improve the state-of-the-art truly local $(deg+1)$-list coloring algorithm from Barenboim et al. [PODC'18] by slightly reducing the runtime to $O(\sqrt{Δ\logΔ})+\log^* n$ and significantly reducing the message size (from huge to roughly $Δ$). Our techniques are inspired by the local conflict coloring framework of Fraigniaud et al. [FOCS'16].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。