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...
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: | |
Online Access: | Get fulltext |
Similar Items
-
Any Monotone Function Is Realized by Interlocked Polygons
by: Erik D. Demaine, et al.
Published: (2012-03-01) -
Zipper unfolding of domes and prismoids
by: Demaine, Erik D., et al.
Published: (2015) -
Any Monotone Function Is Realized by Interlocked Polygons
by: Demaine, Erik D., et al.
Published: (2014) -
Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
by: Demaine, Erik D., et al.
Published: (2011) -
Swapping Labeled Tokens on Graphs
by: Yamanaka, Katsuhisa, et al.
Published: (2015)