|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/15125
|
| タイトル: | Sliding Tokens on a Cactus |
| 著者: | Hoang Duc Anh
Uehara, Ryuhei |
| キーワード: | reconfiguration problem
token sliding
independent set
cactus |
| 発行日: | 2016-12-12 |
| 出版者: | Schloss Dagstuhl |
| 誌名: | The 27th International Symposium on Algorithms and Computation (ISAAC 2016) |
| 巻: | 64 |
| 開始ページ: | 37:1 |
| 終了ページ: | 37:26 |
| DOI: | 10.4230/LIPIcs.ISAAC.2016.37 |
| 抄録: | 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 |
| 資料タイプ: | publisher |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 23596.pdf | | 757Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
