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...

Celý popis

Podrobná bibliografie

Vydáno v:	Theory and practice of logic programming Ročník 24; číslo 4; s. 755 - 771
Hlavní autoři:	KATO, MASATO, BANBARA, MUTSUNORI, SCHAUB, TORSTEN, SOH, TAKEHIDE, TAMURA, NAOYUKI
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cambridge, UK Cambridge University Press 01.07.2024
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!