The complexity of dominating set reconfiguration

Suppose that we are given two dominating sets Ds and Dt of a graph G whose cardinalities are at most a given threshold k. Then, we are asked whether there exists a sequence of dominating sets of G between Ds and Dt such that each dominating set in the sequence is of cardinality at most k and can be...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 651; pp. 37 - 49
Main Authors:	Haddadan, Arash, Ito, Takehiro, Mouawad, Amer E., Nishimura, Naomi, Ono, Hirotaka, Suzuki, Akira, Tebbal, Youcef
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 25.10.2016
Subjects:	Algorithms Combinatorial reconfiguration Complexity Deletion Dominating set Forests Graph algorithm Graph theory Graphs Intervals Reconfiguration Dominating set Combinatorial reconfiguration Graph algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!