Linear-Time Algorithm for Sliding Tokens on Trees

Linear-Time Algorithm for Sliding Tokens on Trees

Suppose that we are given two independent sets I [subscript b] and I [subscript r] of a graph such that ∣ I [subscript b] ∣ = ∣ I [subscript r] ∣, and imagine that a token is placed on each vertex in I [subscript b]. Then, the sliding token problem is to determine whether there exists a sequence of...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Fox-Epstein, Eli (Author), Hoang, Duc A. (Author), Ito, Takehiro (Author), Ono, Hirotaka (Author), Otachi, Yota (Author), Uehara, Ryuhei (Author), Yamada, Takeshi (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer-Verlag, 2015-11-23T14:48:03Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items