Distributed Reconfiguration of Spanning Trees

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We introduce a new type of distributed reconfiguration problem, where an initial instance of a combinatorial object is transformed to a goal instance by “local” exchange operations. We present a distributed algorithm that transforms an arbitrary spanning tree to another one through a sequence of spanning trees. We then discuss distributed reconfiguration of hypertrees and maximum bipartite matchings.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, SSS 2021, Proceedings
EditorsColette Johnen, Elad Michael Schiller, Stefan Schmid
PublisherSpringer Science and Business Media Deutschland GmbH
Pages516-520
Number of pages5
ISBN (Print)9783030910808
DOIs
Publication statusPublished - 2021
Event23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 - Virtual, Online
Duration: Nov 17 2021Nov 20 2021

Publication series

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

Conference

Conference23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021
CityVirtual, Online
Period11/17/2111/20/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

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

Cite this