On the parameterized complexity for token jumping on graphs

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

研究成果: 著書/レポートタイプへの貢献会議での発言

21 引用 (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.

元の言語英語
ホスト出版物のタイトルTheory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings
出版者Springer Verlag
ページ341-351
ページ数11
ISBN(印刷物)9783319060880
DOI
出版物ステータス出版済み - 1 1 2014
イベント11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014 - Chennai, インド
継続期間: 4 11 20144 13 2014

出版物シリーズ

名前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

その他

その他11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014
インド
Chennai
期間4/11/144/13/14

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Ito, T., Kamiński, M., Ono, H., Suzuki, A., Uehara, R., & Yamanaka, K. (2014). On the parameterized complexity for token jumping on graphs. : Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings (pp. 341-351). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8402 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-06089-7_24