### Abstract

Suppose that we are given two independent sets I_{0} and I _{r} of a graph such that |I_{0}| = |I_{r}|, and imagine that a token is placed on each vertex in I_{0}. Then, the token jumping problem is to determine whether there exists a sequence of independent sets which transforms I_{0} into I_{r} 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 I_{0} and I_{r} with the minimum number of token movements.

Original language | English |
---|---|

Title of host publication | Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings |

Publisher | Springer-Verlag |

Pages | 341-351 |

Number of pages | 11 |

ISBN (Print) | 9783319060880 |

DOIs | |

Publication status | Published - 2014 Jan 1 |

Event | 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014 - Chennai, India Duration: 2014 Apr 11 → 2014 Apr 13 |

### Publication series

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

Volume | 8402 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014 |
---|---|

Country | India |

City | Chennai |

Period | 14/4/11 → 14/4/13 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'On the parameterized complexity for token jumping on graphs'. Together they form a unique fingerprint.

## Cite this

*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