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

关于Local分布图问题的复杂性

On the Complexity of Local Distributed Graph Problems

Mohsen Ghaffari, Fabian Kuhn, Yannic Maus

摘要:

本文主要研究Linial [FOCS '87]提出的分布式计算的图论模型中图问题的复杂性。众所周知,对于许多经典的分布式图问题(包括最大独立集(MIS)和$(Δ+1)$ -顶点着色),随机复杂性至多是网络大小$n$的多对数,而最佳确定性复杂性通常是$2^{O(\sqrt{\log n})}$。理解和缩小这个指数差距被认为是分布式图算法领域长期存在的中心问题之一。我们通过引入一个复杂性理论框架来研究这个问题,这个框架使我们能够了解随机性在模型中的作用。我们定义的S模型作为一个连续的版本的S模型。我们的框架使我们能够证明完整性的结果,这类问题,可以有效地解决在SRESH模型,这意味着,如果任何完整的问题可以解决确定性的$\log^{O(1)} n$轮在SRESH模型,我们可以确定性地解决所有有效的SLOCAL问题(包括MIS和$(Δ+1)$着色)在$\log^{O(1)} n$轮在SRESH模型。我们表明,一个相当基本的外观图着色问题是完整的,在上述意义上:颜色的图的节点与颜色红色和蓝色,使每个节点足够大的多对数度至少有一个邻居的每种颜色。这个问题有一个平凡的零轮随机解。该结果可以被看作是表明,唯一的障碍,以获得有效的确定性算法在ESTA模型是一个有效的算法,近似四舍五入的分数值到整数值。

英文摘要:

This paper is centered on the complexity of graph problems in the well-studied LOCAL model of distributed computing, introduced by Linial [FOCS '87]. It is widely known that for many of the classic distributed graph problems (including maximal independent set (MIS) and $(Δ+1)$-vertex coloring), the randomized complexity is at most polylogarithmic in the size $n$ of the network, while the best deterministic complexity is typically $2^{O(\sqrt{\log n})}$. Understanding and narrowing down this exponential gap is considered to be one of the central long-standing open questions in the area of distributed graph algorithms. We investigate the problem by introducing a complexity-theoretic framework that allows us to shed some light on the role of randomness in the LOCAL model. We define the SLOCAL model as a sequential version of the LOCAL model. Our framework allows us to prove completeness results with respect to the class of problems which can be solved efficiently in the SLOCAL model, implying that if any of the complete problems can be solved deterministically in $\log^{O(1)} n$ rounds in the LOCAL model, we can deterministically solve all efficient SLOCAL-problems (including MIS and $(Δ+1)$-coloring) in $\log^{O(1)} n$ rounds in the LOCAL model. We show that a rather rudimentary looking graph coloring problem is complete in the above sense: Color the nodes of a graph with colors red and blue such that each node of sufficiently large polylogarithmic degree has at least one neighbor of each color. The problem admits a trivial zero-round randomized solution. The result can be viewed as showing that the only obstacle to getting efficient determinstic algorithms in the LOCAL model is an efficient algorithm to approximately round fractional values into integer values.

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

↑