On the parameterized complexity for token jumping on graphs

Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka

研究成果: Conference contribution

24 被引用数 (Scopus)

抄録

Suppose that we are given two independent sets I0 and I r of a graph such that |I0| = |Ir|, and imagine that a token is placed on each vertex in I0. Then, the token jumping problem is to determine whether there exists a sequence of independent sets which transforms I0 into Ir so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. Therefore, all independent sets in the sequence must be of the same cardinality. This problem is PSPACE-complete even for planar graphs with maximum degree three. In this paper, we first show that the problem is W[1]-hard when parameterized only by the number of tokens. We then give an FPT algorithm for general graphs when parameterized by both the number of tokens and the maximum degree. Our FPT algorithm can be modified so that it finds an actual sequence of independent sets between I0 and Ir with the minimum number of token movements.

本文言語English
ホスト出版物のタイトルTheory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings
出版社Springer Verlag
ページ341-351
ページ数11
ISBN(印刷版)9783319060880
DOI
出版ステータスPublished - 2014
イベント11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014 - Chennai, India
継続期間: 2014 4 112014 4 13

出版物シリーズ

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

Other

Other11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014
国/地域India
CityChennai
Period14/4/1114/4/13

ASJC Scopus subject areas

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

フィンガープリント

「On the parameterized complexity for token jumping on graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル