The complexity of dominating set reconfiguration

Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

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 obtained from the previous one by either adding or deleting exactly one vertex. This decision problem is known to be PSPACE-complete in general. In this paper, we study the complexity of this problem from the viewpoint of graph classes. We first prove that the problem remains PSPACE-complete even for planar graphs, bounded bandwidth graphs, split graphs, and bipartite graphs. We then give a general scheme to construct linear-time algorithms and show that the problem can be solved in linear time for cographs, trees, and interval graphs. Furthermore, for these tractable cases, we can obtain a desired sequence if it exists such that the number of additions and deletions is bounded by O(n), where n is the number of vertices in the input graph.

本文言語English
ホスト出版物のタイトルAlgorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings
編集者Frank Dehne, Jorg-Rudiger Sack, Ulrike Stege
出版社Springer Verlag
ページ398-409
ページ数12
ISBN(印刷版)9783319218397
DOI
出版ステータスPublished - 2015
イベント14th International Symposium on Algorithms and Data Structures, WADS 2015 - Victoria, Canada
継続期間: 2015 8 52015 8 7

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9214
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other14th International Symposium on Algorithms and Data Structures, WADS 2015
国/地域Canada
CityVictoria
Period15/8/515/8/7

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「The complexity of dominating set reconfiguration」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル