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

Full description

Bibliographic Details

Published in:	Theory and practice of logic programming Vol. 24; no. 4; pp. 755 - 771
Main Authors:	KATO, MASATO, BANBARA, MUTSUNORI, SCHAUB, TORSTEN, SOH, TAKEHIDE, TAMURA, NAOYUKI
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.07.2024
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!