Kavli Affiliate: Naoyuki Tamura | Summary: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 general. The concept of the […]
Continue.. Dominating Set Reconfiguration with Answer Set Programming