We investigate a distributed maximal independent set reconfiguration problem, in which there are two MIS for which every node is given its membership status, and the nodes need to communicate with their neighbors to find a reconfiguration schedule from the first MIS to the second. We forbid two neighbors to change their membership status at the same step. We provide efficient solutions when the intermediate sets are only required to be independent and 4-dominating, which is almost always possible. Consequently, our goal is to pin down the tradeoff between the possible length of the schedule and the number of communication rounds. We prove that a constant length schedule can be found in $O(\mathtt{\text{MIS}}+\mathtt{\text{R32}})$ rounds. For bounded degree graphs, this is $O({\log }^{⁎}n)$ rounds and we show that it is necessary. On the other extreme, we show that with a constant number of rounds we can find a linear length schedule.

我们研究了一个分布式最大独立集重新配置问题，其中有两个节点的MIS被赋予其​​成员资格的状态，并且节点需要与其邻居进行通信以找到从第一个MIS到第二个MIS的重新配置计划。我们禁止两个邻居同时更改其会员身份。当中间集仅要求独立且以4为主导时，我们提供有效的解决方案，这几乎总是可能的。因此，我们的目标是在时间表的可能长度和通信回合数量之间权衡取舍。我们证明可以在$Ø（\mathtt{\text{管理信息系统}}+\mathtt{\text{R32}}）$回合。对于有界度图，这是$Ø（{\mathrm{日志}}^{⁎}ñ）$回合，我们证明这是必要的。另一方面，我们证明了在恒定的回合数下，我们可以找到线性长度计划。