Decremental Optimization of Dominating Sets Under the Reconfiguration Framework

Alexandre Blanché, Haruka Mizuta, Paul Ouvrard, Akira Suzuki

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the property that the set forms a dominating set of bounded size. This can be seen as the optimization variant of the dominating set reconfiguration problem, where two dominating sets are given and the question is merely whether they can be reached from one another through elementary operations. We show that this problem is PSPACE-complete, even if the input graph is a bipartite graph, a split graph, or has bounded pathwidth. On the positive side, we give linear-time algorithms for cographs, trees and interval graphs. We also study the parameterized complexity of this problem. More precisely, we show that the problem is W[2]-hard when parameterized by the upper bound on the size of an intermediary dominating set. On the other hand, we give fixed-parameter algorithms with respect to the minimum size of a vertex cover, or d + s where d is the degeneracy and s is the upper bound of the output solution.

本文言語English
ホスト出版物のタイトルCombinatorial Algorithms - 31st International Workshop, IWOCA 2020, Proceedings
編集者Leszek Gasieniec, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
出版社Springer
ページ69-82
ページ数14
ISBN(印刷版)9783030489656
DOI
出版ステータスPublished - 2020
イベント31st International Workshop on Combinatorial Algorithms, IWOCA 2020 - Bordeaux, France
継続期間: 2020 6 82020 6 10

出版物シリーズ

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

Conference

Conference31st International Workshop on Combinatorial Algorithms, IWOCA 2020
国/地域France
CityBordeaux
Period20/6/820/6/10

ASJC Scopus subject areas

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

フィンガープリント

「Decremental Optimization of Dominating Sets Under the Reconfiguration Framework」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル