Dominating Set Reconfiguration with Answer Set Programming

The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in gene...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory and practice of logic programming Jg. 24; H. 4; S. 755 - 771
Hauptverfasser:	KATO, MASATO, BANBARA, MUTSUNORI, SCHAUB, TORSTEN, SOH, TAKEHIDE, TAMURA, NAOYUKI
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.07.2024
Schlagworte:	Combinatorial analysis Declarative programming Graph coloring Mathematical programming Original Article Reconfiguration Social networks Wireless networks combinatorial reconfiguration dominating set reconfiguration answer set programming
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!