Complexity of independent set reconfigurability problems

Authors:
Marcin Kamiski;Paul Medvedev;Martin Milani
Affiliations:
Département dInformatique, Université Libre de Bruxelles, O8.114, CP 212, Bvd. du Triomphe, 1050 Bruxelles, Belgium;Department of Computer Science and Engineering, University of California, San Diego, 9500 Gilman Drive, Mail Code 0404, La Jolla, CA 92093-0404, USA;University of Primorska, UP IAM, Muzejski trg 2, SI6000 Koper, Slovenia and University of Primorska, UP FAMNIT, Glagoljaka 8, SI6000 Koper, Slovenia
Venue:
Theoretical Computer Science
Year:
2012

Citing 10
Cited 2

PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation

Theoretical Computer Science - Game theory meets theoretical computer science
Even-hole-free graphs part I: Decomposition theorem

Journal of Graph Theory
Even-hole-free graphs part II: Recognition algorithm

Journal of Graph Theory
Mixing 3-colourings in bipartite graphs

European Journal of Combinatorics
Reconfiguration of List Edge-Colorings in a Graph

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances

Theoretical Computer Science
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

SIAM Journal on Computing
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
On the complexity of reconfiguration problems

Theoretical Computer Science
Shortest paths between shortest paths and independent sets

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms

The complexity of rerouting shortest paths

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The complexity of rerouting shortest paths

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and removal) and analyze relationships between them. We prove that independent set reconfigurability in perfect graphs (under any of the three models) generalizes the shortest path reconfigurability problem in general graphs and is therefore PSPACE-complete. On the positive side, we give polynomial results for even-hole-free graphs and P"4-free graphs.