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

带局部建议的分布式计算

Distributed Computation with Local Advice

Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela

AI总结:

本文研究带建议的分布式局部计算,证明多种图问题(包括LCL、几乎平衡定向、Δ-着色和3-着色)在次指数增长图或一般图中仅需每节点1比特建议即可解决,且建议可任意稀疏,并给出基于指数时间假设的条件性下界。

摘要:

在本文中,我们研究带建议的局部计算:目标是用分布式算法在 T(Δ) 个通信轮内解决图问题 Π,其中 T 是仅依赖于图的最大度数 Δ 的函数,关键问题是每个节点需要多少比特的建议。我们的一些结果涉及局部可检查标记问题(LCLs),这类约束满足图问题可以用有限的合法输入/输出标记邻域集合来定义。我们的主要结果如下:- 在具有次指数增长的图中,任何 LCL 都可以用每个节点仅 1 比特的建议来解决。此外,我们可以使携带建议比特的节点集合任意稀疏。作为推论,任何 LCL 在具有次指数增长的图中都承认每个节点 1 比特的局部可检查证明。- 次指数增长的假设由一个条件性下界补充:假设指数时间假设成立,存在局部可检查标记问题在一般情况下无法用任何常数数量的每节点比特来解决。- 在任意图中,我们可以用每个节点 1 比特的建议找到一个几乎平衡的定向,并且同样可以使建议任意稀疏。作为推论,我们还可以压缩任意边子集,使得度数为 d 的节点仅存储 d/2 + 2 比特,并且可以在 T(Δ) 轮内局部解压。- 在任意最大度数为 Δ 的图中,我们可以用每个节点 1 比特的建议找到一个 Δ-着色(如果存在),并且同样可以使建议任意稀疏。- 在任意 3-可着色图中,我们可以用每个节点 1 比特的建议找到一个 3-着色。作为推论,在有界度图中存在一个局部可检查证明,用每个节点 1 比特的建议证明 3-可着色性。

英文摘要:

In this work we study local computation with advice: the goal is to solve a graph problem $Π$ with a distributed algorithm in $T(Δ)$ communication rounds, for some function $T$ that only depends on the maximum degree $Δ$ of the graph, and the key question is how many bits of advice per node are needed. Some of our results regard Locally Checkable Labeling problems (LCLs), which are constraint-satisfaction graph problems that can be defined with a finite set of valid input/output-labeled neighborhoods. Our main results are: - Any LCL can be solved with only $1$ bit of advice per node in graphs with sub-exponential growth. Moreover, we can make the set of nodes that carry advice bits arbitrarily sparse. As a corollary, any LCL admits a locally checkable proof with $1$ bit per node in graphs with sub-exponential growth. - The assumption of sub-exponential growth is complemented by a conditional lower bound: assuming the Exponential-Time Hypothesis, there are locally checkable labeling problems that cannot be solved in general with any constant number of bits per node. - In any graph we can find an almost-balanced orientation with $1$ bit of advice per node, and again we can make the advice arbitrarily sparse. As a corollary, we can also compress an arbitrary subset of edges so that a node of degree $d$ stores only $d/2 + 2$ bits, and we can decompress it locally, in $T(Δ)$ rounds. - In any graph of maximum degree $Δ$, we can find a $Δ$-coloring (if it exists) with $1$ bit of advice per node, and again, we can make the advice arbitrarily sparse. - In any $3$-colorable graph, we can find a $3$-coloring with $1$ bit of advice per node. As a corollary, in bounded-degree graphs there is a locally checkable proof that certifies $3$-colorability with $1$ bit of advice per node.

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

↑