Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited

Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration problem asks whether we can reach one vertex set from the other by repeating prescribed modification steps while maintaining feasibility. In this setting, as reported by Mouawad et al. (IPEC, Springer, Be...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 86; H. 11; S. 3395 - 3424
Hauptverfasser:	Gima, Tatsuya, Ito, Takehiro, Kobayashi, Yasuaki, Otachi, Yota
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2024 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Completeness Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Feasibility Mathematics of Computing Parameterization Parameters Reconfiguration Theorems Theory of Computation Vertex sets Combinatorial reconfiguration Neighborhood diversity Fixed-parameter tractability Monadic second-order logic Treedepth
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!