Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints

We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields that such a transformation always exists if we have no constrai...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 85; H. 9; S. 2779 - 2816
Hauptverfasser:	Bousquet, Nicolas, Ito, Takehiro, Kobayashi, Yusuke, Mizuta, Haruka, Ouvrard, Paul, Suzuki, Akira, Wasa, Kunihiro
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2023 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Lower bounds Mathematics of Computing Polynomials Reconfiguration Theory of Computation Transformations Upper bounds Combinatorial reconfiguration Polynomial-time algorithms PSPACE Spanning trees
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!