Parameterized complexity of independent set reconfiguration problems

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. We finally show that one of the results for token jumping can be extended to a more generalized reconfiguration problem for independent sets, called token addition and removal .

[1]  Paul S. Bonsma.  Independent Set Reconfiguration in Cographs and their Generalizations , 2016, J. Graph Theory.

[2]  Aline Parreau,et al.  Token Jumping in Minor-Closed Classes , 2017, FCT.

[3]  Naomi Nishimura,et al.  Reconfiguration over Tree Decompositions , 2014, IPEC.

[4]  Fahad Panolan,et al.  Reconfiguration on sparse graphs , 2018, J. Comput. Syst. Sci..

[5]  Paul S. Bonsma,et al.  Reconfiguring Independent Sets in Claw-Free Graphs , 2014, SWAT.

[6]  Takehiro Ito,et al.  Fixed-Parameter Tractability of Token Jumping on Planar Graphs , 2014, ISAAC.

[7]  Ryuhei Uehara,et al.  Sliding Tokens on a Cactus , 2016, ISAAC.

[8]  Naomi Nishimura,et al.  On the Parameterized Complexity of Reconfiguration Problems , 2013, Algorithmica.

[9]  Erik D. Demaine,et al.  PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..

[10]  Martin Milanic,et al.  Complexity of independent set reconfigurability problems , 2012, Theor. Comput. Sci..

[11]  Paul S. Bonsma,et al.  Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances , 2007, Theor. Comput. Sci..

[12]  Takehiro Ito,et al.  On the complexity of reconfiguration problems , 2011, Theor. Comput. Sci..

[13]  Jan van den Heuvel,et al.  The complexity of change , 2013, Surveys in Combinatorics.

[14]  Takehiro Ito,et al.  On the Parameterized Complexity for Token Jumping on Graphs , 2014, TAMC.

[15]  Erik D. Demaine,et al.  Games, puzzles and computation , 2009 .

[16]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[17]  Marthe Bonamy,et al.  Token Sliding on Chordal Graphs , 2016, WG.

[18]  Ryuhei Uehara,et al.  Shortest Reconfiguration of Sliding Tokens on a Caterpillar , 2016, WALCOM.

[19]  Marcin Wrochna,et al.  Reconfiguration in bounded bandwidth and tree-depth , 2014, J. Comput. Syst. Sci..

[20]  Yota Otachi,et al.  Linear-time algorithm for sliding tokens on trees , 2014, Theor. Comput. Sci..

[21]  Yota Otachi,et al.  Sliding Token on Bipartite Permutation Graphs , 2015, ISAAC.

[22]  Naomi Nishimura,et al.  Introduction to Reconfiguration , 2018, Algorithms.