On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

In a reconfiguration version of a decision problem Q the input is an instance of Q and two feasible solutions S and T . The objective is to determine whether there exists a step-by-step transformation between S and T such that all intermediate steps also constitute feasible solutions. In this work,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2022-02, Vol.84 (2), p.482-509
Hauptverfasser:	Lokshtanov, Daniel, Mouawad, Amer E., Panolan, Fahad, Siebertz, Sebastian
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Mathematics of Computing Parameterization Parameters Polynomials Reconfiguration Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!