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

有根树中的局部可检验问题

Locally Checkable Problems in Rooted Trees

Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko

摘要:

考虑任何局部可检查的标签问题$Π$在根正规树:有一个有限的标签$Σ$的集合,并为每个标签$x \in Σ$,我们指定什么是允许的标签组合的儿童的内部节点的标签$x$(叶节点是不受约束的)。这种形式主义是有足够的表现力,以捕捉许多经典的分布式计算中研究的问题,包括顶点着色,边着色,和最大独立集。我们发现,任何这样的问题$Π$的分布式计算复杂性属于以下类别之一:它是$O(1)$,$Θ(\log^* n)$,$Θ(\log n)$,或$n^{Θ(1)}$轮树中的$n$节点(和所有这些类都是非空的)。我们发现,任何给定的问题的复杂性是相同的,在所有四个标准模型的分布式图算法:确定性$\mathsf{LOCAL}$,随机$\mathsf{LOCAL}$,确定性$\mathsf{CONGEST}$,随机$\mathsf{CONGEST}$模型。特别是,我们表明,随机性并没有帮助,在这种情况下,和复杂性类$Θ(\log \log n)$不存在(虽然它确实存在于更广泛的设置一般树)。我们还展示了如何系统地确定任何这样的问题$Π$的复杂性类,即,$Π$是否进行$O(1)$、$Θ(\log^* n)$、$Θ(\log n)$或$n^{Θ(1)}$轮次。虽然该算法可能需要指数时间的描述$Π$的大小,但它仍然是实用的:我们提供了一个免费提供的实现分类算法,它是足够快的分类感兴趣的许多问题。

英文摘要:

Consider any locally checkable labeling problem $Π$ in rooted regular trees: there is a finite set of labels $Σ$, and for each label $x \in Σ$ we specify what are permitted label combinations of the children for an internal node of label $x$ (the leaf nodes are unconstrained). This formalism is expressive enough to capture many classic problems studied in distributed computing, including vertex coloring, edge coloring, and maximal independent set. We show that the distributed computational complexity of any such problem $Π$ falls in one of the following classes: it is $O(1)$, $Θ(\log^* n)$, $Θ(\log n)$, or $n^{Θ(1)}$ rounds in trees with $n$ nodes (and all of these classes are nonempty). We show that the complexity of any given problem is the same in all four standard models of distributed graph algorithms: deterministic $\mathsf{LOCAL}$, randomized $\mathsf{LOCAL}$, deterministic $\mathsf{CONGEST}$, and randomized $\mathsf{CONGEST}$ model. In particular, we show that randomness does not help in this setting, and the complexity class $Θ(\log \log n)$ does not exist (while it does exist in the broader setting of general trees). We also show how to systematically determine the complexity class of any such problem $Π$, i.e., whether $Π$ takes $O(1)$, $Θ(\log^* n)$, $Θ(\log n)$, or $n^{Θ(1)}$ rounds. While the algorithm may take exponential time in the size of the description of $Π$, it is nevertheless practical: we provide a freely available implementation of the classifier algorithm, and it is fast enough to classify many problems of interest.

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

↑