On the Parameterized Complexity for Token Jumping on Graphs
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-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.
Unable to display preview. Download preview PDF.
- 6.Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters (2009)Google Scholar
- 7.Ito, T., Demaine, E.D.: Approximability of the subset sum reconfiguration problem. To appear in J. Combinatorial Optimization, doi:10.1007/s10878-012-9562-zGoogle Scholar
- 11.Ito, T., Kawamura, K., Zhou, X.: An improved sufficient condition for reconfiguration of list edge-colorings in a tree. IEICE Trans. on Information and Systems E95-D, 737–745 (2012)Google Scholar
- 16.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)Google Scholar