|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/15359
|
| タイトル: | Sliding tokens on block graphs |
| 著者: | Hoang, Duc A.
Fox-Epstein, Eli
Uehara, Ryuhei |
| キーワード: | reconfiguration problem
sliding token problem
block graph
independent set |
| 発行日: | 2017-02-21 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 10167 |
| 開始ページ: | 460 |
| 終了ページ: | 471 |
| DOI: | 10.1007/978-3-319-53925-6_36 |
| 抄録: | Let I, J be two given independent sets of a graph G. Imagine that the vertices of an independent set are viewed as tokens (coins). A token is allowed to move (or slide) from one vertex to one of its neighbors. The Sliding Token problem asks whether there exists a sequence of independent sets of G starting from I and ending with J such that each intermediate member of the sequence is obtained from the previous one by moving a token according to the allowed rule. In this paper, we claim that this problem is solvable in polynomial time when the input graph is a block graph—a graph whose blocks are cliques. Our algorithm is developed based on the characterization of a non-trivial structure that, in certain conditions, can be used to indicate a no-instance of the problem. Without such a structure, a sequence of token slidings between any two independent sets exists. |
| Rights: | This is the author-created version of Springer, Duc A. Hoang, Eli Fox-Epstein and Ryuhei Uehara, Lecture Notes in Computer Science, 10167, 2017, 460-471. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-53925-6_36 |
| URI: | http://hdl.handle.net/10119/15359 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 23598.pdf | | 175Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
