On the parameterized complexity for token jumping on graphs

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings
PublisherSpringer Verlag
Pages341-351
Number of pages11
ISBN (Print)9783319060880
DOIs
Publication statusPublished - Jan 1 2014
Event11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014 - Chennai, India
Duration: Apr 11 2014Apr 13 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8402 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014
CountryIndia
CityChennai
Period4/11/144/13/14

Fingerprint

Parameterized Complexity
Independent Set
Graph in graph theory
Maximum Degree
Vertex of a graph
Planar graph
Cardinality
Transform

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ito, T., Kamiński, M., Ono, H., Suzuki, A., Uehara, R., & Yamanaka, K. (2014). On the parameterized complexity for token jumping on graphs. In 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); Vol. 8402 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-06089-7_24

On the parameterized complexity for token jumping on graphs. / Ito, Takehiro; Kamiński, Marcin; Ono, Hirotaka; Suzuki, Akira; Uehara, Ryuhei; Yamanaka, Katsuhisa.

Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings. Springer Verlag, 2014. p. 341-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8402 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ito, T, Kamiński, M, Ono, H, Suzuki, A, Uehara, R & Yamanaka, K 2014, On the parameterized complexity for token jumping on graphs. in Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8402 LNCS, Springer Verlag, pp. 341-351, 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, Chennai, India, 4/11/14. https://doi.org/10.1007/978-3-319-06089-7_24
Ito T, Kamiński M, Ono H, Suzuki A, Uehara R, Yamanaka K. On the parameterized complexity for token jumping on graphs. In Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings. Springer Verlag. 2014. p. 341-351. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-06089-7_24
Ito, Takehiro ; Kamiński, Marcin ; Ono, Hirotaka ; Suzuki, Akira ; Uehara, Ryuhei ; Yamanaka, Katsuhisa. / On the parameterized complexity for token jumping on graphs. Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings. Springer Verlag, 2014. pp. 341-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{21c3db8f98084052af3983a1fda9ac55,
title = "On the parameterized complexity for token jumping on graphs",
abstract = "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.",
author = "Takehiro Ito and Marcin Kamiński and Hirotaka Ono and Akira Suzuki and Ryuhei Uehara and Katsuhisa Yamanaka",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-06089-7_24",
language = "English",
isbn = "9783319060880",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "341--351",
booktitle = "Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings",
address = "Germany",

}

TY - GEN

T1 - On the parameterized complexity for token jumping on graphs

AU - Ito, Takehiro

AU - Kamiński, Marcin

AU - Ono, Hirotaka

AU - Suzuki, Akira

AU - Uehara, Ryuhei

AU - Yamanaka, Katsuhisa

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958541436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958541436&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-06089-7_24

DO - 10.1007/978-3-319-06089-7_24

M3 - Conference contribution

AN - SCOPUS:84958541436

SN - 9783319060880

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 341

EP - 351

BT - Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings

PB - Springer Verlag

ER -