eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-08-18
23:1
23:14
10.4230/LIPIcs.MFCS.2021.23
article
Reconfiguring Independent Sets on Interval Graphs
Briański, Marcin
1
Felsner, Stefan
2
Hodor, Jędrzej
1
Micek, Piotr
1
Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland
Institut für Mathematik, Technische Universität Berlin, Germany
We study reconfiguration of independent sets in interval graphs under the token sliding rule. We show that if two independent sets of size k are reconfigurable in an n-vertex interval graph, then there is a reconfiguration sequence of length 𝒪(k⋅ n²). We also provide a construction in which the shortest reconfiguration sequence is of length Ω(k²⋅ n).
As a counterpart to these results, we also establish that Independent Set Reconfiguration is PSPACE-hard on incomparability graphs, of which interval graphs are a special case.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol202-mfcs2021/LIPIcs.MFCS.2021.23/LIPIcs.MFCS.2021.23.pdf
reconfiguration
independent sets
interval graphs