Incremental Optimization of Independent Sets Under the Reconfiguration Framework

Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

Suppose that we are given an independent set I0 of a graph G, and an integer (forumala presented). Then, we are asked to find an independent set of G having the maximum size among independent sets that are reachable from I0 by either adding or removing a single vertex at a time such that all intermediate independent sets are of size at least l. We show that this problem is PSPACE-hard even for bounded pathwidth graphs, and remains NP-hard for planar graphs. On the other hand, we give a linear-time algorithm to solve the problem for chordal graphs. We also study the parameterized complexity of the problem with respect to the following three parameters: the degeneracy d of an input graph, a lower bound l on the size of independent sets, and a lower bound s on the size of a solution reachable from I0. We show that the problem is fixed-parameter intractable when only one of d,l, and s is taken as a parameter. On the other hand, we give a fixed-parameter algorithm when parameterized by s+d this result implies that the problem parameterized only by s is fixed-parameter tractable for planar graphs, and for bounded treewidth graphs.

本文言語English
ホスト出版物のタイトルComputing and Combinatorics - 25th International Conference, COCOON 2019, Proceedings
編集者Ding-Zhu Du, Zhenhua Duan, Cong Tian
出版社Springer Verlag
ページ313-324
ページ数12
ISBN(印刷版)9783030261757
DOI
出版ステータスPublished - 2019
イベント25th International Computing and Combinatorics Conference, COCOON 2019 - Xi'an, China
継続期間: 2019 7 292019 7 31

出版物シリーズ

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

Conference

Conference25th International Computing and Combinatorics Conference, COCOON 2019
国/地域China
CityXi'an
Period19/7/2919/7/31

ASJC Scopus subject areas

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

フィンガープリント

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

引用スタイル