arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.06043cs.DScs.DC
收藏

拥塞Clique中的简单确定常圆染色

Simple, Deterministic, Constant-Round Coloring in the Congested Clique

Artur Czumaj, Peter Davies, Merav Parter

摘要:

我们解决的复杂性的$(Δ+1)$ -着色和$(Δ+1)$ -列表着色问题的拥塞CLIQUE模型,提出了一个简单的确定性算法运行在一个恒定的轮数。这与最近由Chang等人(PODC'19)提出的突破性的随机化恒定轮$(Δ+1)$ -列表着色算法的复杂性相匹配,并且显著地改进了Parter(ICALP'18)的现有技术水平的$O(\log Δ)$ -轮确定性$(Δ+1)$ -着色界。我们的算法的一个显着的属性是它的简单性。鉴于国家的最先进的随机算法,这个问题是基于相当复杂的局部着色算法的张等人。(STOC'18),我们的算法可以描述在短短几行。在高层次上,它应用了递归过程的仔细去随机化,该过程将节点及其相应的调色板划分为单独的bin。我们表明,经过$O(1)$递归步骤,剩余的未着色的子图内的每个bin具有线性大小,因此可以解决本地收集到一个单一的节点。该算法也可以在大规模并行计算(MPC)模型中实现,只要每个机器具有线性(在$n$中,输入图中的节点数)空间。我们还展示了我们的算法的MPC制度中,机器具有次线性空间的扩展:我们提出了第一个确定性的$(Δ+1)$ -列表着色算法设计的次线性空间MPC,它运行在$O(\log Δ+ \log\log n)$轮。

英文摘要:

We settle the complexity of the $(Δ+1)$-coloring and $(Δ+1)$-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round $(Δ+1)$-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art $O(\log Δ)$-round deterministic $(Δ+1)$-coloring bound of Parter (ICALP'18). A remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after $O(1)$ recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in $n$, the number of nodes in the input graph) space. We also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic $(Δ+1)$-list coloring algorithm designed for sublinear-space MPC, which runs in $O(\log Δ+ \log\log n)$ rounds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑