Decentralized Distributed Graph Coloring: Cluster Graphs
CoRR(2024)
摘要
Graph coloring is fundamental to distributed computing. We give an ultrafast
distributed algorithm for coloring cluster graphs. These graphs are obtained
from the underlying communication network by contracting nodes and edges, and
they appear frequently as components in the study of distributed algorithms. In
particular, we give a O(log^* n)-round algorithm to Δ+1-color cluster
graphs of at least polylogarithmic degree. The previous best bound known was
poly(log n) [Flin et.al, SODA'24]. This properly generalizes results in the
COONGEST model and shows that distributed graph problems can be quickly solved
even when the node itself is decentralized.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要