Sliding Token is a natural reconfiguration problem in which vertices of independent sets are iteratively replaced by neighbors. We develop techniques that may be useful in answering the conjecture that Sliding Token is polynomial-time decidable on bipartite graphs. Along the way, we give efficient algorithms for Sliding Token on bipartite permutation and bipartite distance-hereditary graphs.
CITATION STYLE
Fox-Epstein, E., Hoang, D. A., Otachi, Y., & Uehara, R. (2015). Sliding token on bipartite permutation graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9472, pp. 237–247). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0_21
Mendeley helps you to discover research relevant for your work.