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

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 651; s. 37 - 49
Hlavní autoři:	Haddadan, Arash, Ito, Takehiro, Mouawad, Amer E., Nishimura, Naomi, Ono, Hirotaka, Suzuki, Akira, Tebbal, Youcef
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 25.10.2016
Témata:	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
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!