Brief Announcement: Distributed Reconfiguration of Spanning Trees

Siddharth Gupta, Manish Kumar, Shreyas Pai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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. We first show that, if the two input spanning trees are rooted then we can transform one into another in one round using a single 1-simultaneous add and delete step 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.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Proceedings
EditorsStéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernandez Anta
PublisherSpringer Science and Business Media Deutschland GmbH
Pages346-351
Number of pages6
ISBN (Print)9783031210167
DOIs
StatePublished - 1 Jan 2022
Event24th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2022 - Clermont-Ferrand, France
Duration: 15 Nov 202217 Nov 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13751 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2022
Country/TerritoryFrance
CityClermont-Ferrand
Period15/11/2217/11/22

Keywords

  • Distributed algorithms
  • Reconfiguration
  • Spanning trees

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Brief Announcement: Distributed Reconfiguration of Spanning Trees'. Together they form a unique fingerprint.

Cite this