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

在线、动态、顺序和分布式图算法中的局部性

Locality in online, dynamic, sequential, and distributed graph algorithms

Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, Jukka Suomela

摘要:

在这项工作中,我们给出了一个统一的观点的地方在四个设置:分布式算法,顺序贪心算法,动态算法和在线算法。我们引入了一种新的计算模型,称为在线搜索模型:对手以与经典在线算法相同的方式逐个显示输入图的节点,但是对于每个新节点,我们在选择输出之前看到其半径T邻域。我们比较了三个其他模型:分布式计算,其中每个节点产生其输出的基础上,其半径T邻域,其顺序对应的Sirp,和动态的,在动态输入图中的变化,只影响半径T邻域的变化点的动态的Sirp模型。SRESH和动态SRESH模型夹在SRESH和在线SRESH模型之间,SRESH是最弱的模型,而在线SRESH是最强的模型。在一般情况下,所有的模型是不同的,但我们特别研究局部可检查的标签问题(LCL),这是一个家庭的图形问题的背景下,分布式图算法的研究。我们证明了LCL问题的路径,循环,根树,所有的模型是大致相等的:任何LCL问题的地方属于同一个广泛的类- $O(\log^* n)$,$Θ(\log n)$,或$n^{Θ(1)}$ -在所有四个模型。特别是,这一结果使一个推广以前的下界结果从EQUIPMENT模型的所有四个模型,它也允许一个模拟,例如动态EQUIPMENT算法有效地在EQUIPMENT模型。我们还证明了这种等价性在一般的二部图中并不成立。我们为二分图中的$3$ -着色问题提供了一个具有局部性$O(\log n)$的在线搜索算法-这是一个具有局部性$Ω(n^{1/2})$和$Ω(n^{1/10})$的问题。

英文摘要:

In this work, we give a unifying view of locality in four settings: distributed algorithms, sequential greedy algorithms, dynamic algorithms, and online algorithms. We introduce a new model of computing, called the online-LOCAL model: the adversary reveals the nodes of the input graph one by one, in the same way as in classical online algorithms, but for each new node we get to see its radius-T neighborhood before choosing the output. We compare the online-LOCAL model with three other models: the LOCAL model of distributed computing, where each node produces its output based on its radius-T neighborhood, its sequential counterpart SLOCAL, and the dynamic-LOCAL model, where changes in the dynamic input graph only influence the radius-T neighborhood of the point of change. The SLOCAL and dynamic-LOCAL models are sandwiched between the LOCAL and online-LOCAL models, with LOCAL being the weakest and online-LOCAL the strongest model. In general, all models are distinct, but we study in particular locally checkable labeling problems (LCLs), which is a family of graph problems studied in the context of distributed graph algorithms. We prove that for LCL problems in paths, cycles, and rooted trees, all models are roughly equivalent: the locality of any LCL problem falls in the same broad class - $O(\log^* n)$, $Θ(\log n)$, or $n^{Θ(1)}$ - in all four models. In particular, this result enables one to generalize prior lower-bound results from the LOCAL model to all four models, and it also allows one to simulate e.g. dynamic-LOCAL algorithms efficiently in the LOCAL model. We also show that this equivalence does not hold in general bipartite graphs. We provide an online-LOCAL algorithm with locality $O(\log n)$ for the $3$-coloring problem in bipartite graphs - this is a problem with locality $Ω(n^{1/2})$ in the LOCAL model and $Ω(n^{1/10})$ in the SLOCAL model.

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

↑