Brief Announcement: Distributed Reconfiguration of Spanning Trees

Siddharth Gupta, Manish Kumar, Shreyas Pai

Abstract: 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 another 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.