JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >

このアイテムの引用には次の識別子を使用してください: http://hdl.handle.net/10119/14783

タイトル: Linear-Time Algorithm for Sliding Tokens on Trees
著者: Demaine, Erik D.
Demaine, Martin L.
Fox-Epstein, Eli
Hoang, Duc A.
Ito, Takehiro
Ono, Hirotaka
Otachi, Yota
Uehara, Ryuhei
Yamada, Takeshi
キーワード: combinatorial reconfiguration
graph algorithm
independent set
sliding token
発行日: 2015-07-28
出版者: Elsevier
誌名: Theoretical Computer Science
巻: 600
開始ページ: 132
終了ページ: 142
DOI: 10.1016/j.tcs.2015.07.037
抄録: Suppose that we are given two independent sets I_b and I_r of a graph such that |I_b| = |I_r|, and imagine that a token is placed on each vertex in I_b. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms I_b into I_r so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in the graph. This problem is known to be PSPACE-complete even for planar graphs, and also for bounded treewidth graphs. In this paper, we thus study the problem restricted to trees, and give the following three results: (1) the decision problem is solvable in linear time; (2) for a yes-instance, we can find in quadratic time an actual sequence of independent sets between I_b and I_r whose length (i.e., the number of token-slides) is quadratic; and (3) there exists an infinite family of instances on paths for which any sequence requires quadratic length.
Rights: Copyright (C)2015, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International license (CC BY-NC-ND 4.0). [http://creativecommons.org/licenses/by-nc-nd/4.0/] NOTICE: This is the author’s version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada, Theoretical Computer Science, 600, 2015, 132-142, http://dx.doi.org/10.1016/j.tcs.2015.07.037
URI: http://hdl.handle.net/10119/14783
資料タイプ: author
出現コレクション:b10-1. 雑誌掲載論文 (Journal Articles)


ファイル 記述 サイズ形式
21795.pdf255KbAdobe PDF見る/開く



お問い合わせ先 : 北陸先端科学技術大学院大学 研究推進課図書館情報係