生成树的分布式重构
Distributed Reconfiguration of Spanning Trees
摘要:
在重构问题中,给定一个问题和该问题的两个可行解,任务是找到从一个解到达另一个解的变换序列,使得每个中间状态也是该问题的可行解。在本文中,我们研究了分布式生成树重构问题,我们定义了一个新的重构步骤,称为$k$ -同时添加和删除,其中每个节点被允许添加最多$k$边缘和删除最多$k$边缘,使多个节点不添加或删除相同的边缘。我们首先观察到,如果两个输入生成树是有根的,那么我们可以使用单个$1$ -在CONGEST模型中的一轮中同时添加和删除步骤来进行重新配置。因此,我们把我们的注意力集中到无根生成树,并表明,将一个无根生成树转换成另一个使用一个单一的$1$ -同时添加和删除步骤需要$Ω(n)$轮的$Ω(n)$模型。我们还表明,转换成另一个使用一个单一的$2$ -同时添加和删除步骤的无根生成树可以在$O(\log n)$轮的CONGEST模型。
英文摘要:
In a reconfiguration problem, given a problem and two feasible solutions of the problem, the task is to find a sequence of transformations to reach from one solution to the other such that every intermediate state is also a feasible solution to the problem. In this paper, we study the distributed spanning tree reconfiguration problem and we define a new reconfiguration step, called $k$-simultaneous add and delete, in which every node is allowed to add at most $k$ edges and delete at most $k$ edges such that multiple nodes do not add or delete the same edge. We first observe that, if the two input spanning trees are rooted, then we can do the reconfiguration using a single $1$-simultaneous add and delete step in one round in the CONGEST model. Therefore, we focus our attention towards unrooted spanning trees and show that transforming an unrooted spanning tree into another using a single $1$-simultaneous add and delete step requires $Ω(n)$ rounds in the LOCAL model. We additionally show that transforming an unrooted spanning tree into another using a single $2$-simultaneous add and delete step can be done in $O(\log n)$ rounds in the CONGEST model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。