JAIST Repository >
School of Information Science >
Conference Papers >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/15125

Title: Sliding Tokens on a Cactus
Authors: Hoang Duc Anh
Uehara, Ryuhei
Keywords: reconfiguration problem
token sliding
independent set
cactus
Issue Date: 2016-12-12
Publisher: Schloss Dagstuhl
Magazine name: The 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Volume: 64
Start page: 37:1
End page: 37:26
DOI: 10.4230/LIPIcs.ISAAC.2016.37
Abstract: Given two independent sets I and J of a graph G, imagine that a token (coin) is placed on each vertex in I. Then, the Sliding Token problem asks if one could transforms I to J using a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors, such that the resulting set of vertices where tokens are placed still remainsindependent. In this paper, we describe a polynomial-time algorithm for solving Sliding Token in case the graph G is a cactus. Our algorithm is designed based on two observations. First, all structures that forbid the existence of a sequence of token slidings between I and J, if exist, can be found in polynomial time. A no-instance may be easily deduced using this characterization. Second, without such forbidden structures, a sequence of token slidings between I and J does exist.
Rights: © Duc A. Hoang and Ryuhei Uehara; licensed under Creative Commons License CC-BY. 27th International Symposium on Algorithms and Computation (ISAAC 2016). Editor: Seok-Hee Hong; Article No. 37; pp. 37:1–37:26. Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
URI: http://hdl.handle.net/10119/15125
Material Type: publisher
Appears in Collections:b11-1. 会議発表論文・発表資料 (Conference Papers)

Files in This Item:

File Description SizeFormat
23596.pdf757KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology