TY - JOUR
T1 - Complexity of independent set reconfigurability problems
AU - Kamiski, Marcin
AU - Medvedev, Paul
AU - Milanič, Martin
PY - 2012/6/29
Y1 - 2012/6/29
N2 - 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 P4-free graphs.
AB - 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 P4-free graphs.
UR - http://www.scopus.com/inward/record.url?scp=84861234762&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861234762&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2012.03.004
DO - 10.1016/j.tcs.2012.03.004
M3 - Article
AN - SCOPUS:84861234762
SN - 0304-3975
VL - 439
SP - 9
EP - 15
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -