Polynomial-Time Algorithm for Sliding Tokens on Trees

DOI10.1007/978-3-319-13075-0_31zbMath1435.05189OpenAlexW1883335082MaRDI QIDQ2942646

Eli Fox-Epstein, Takehiro Ito, Takeshi Yamada, Yota Otachi, Erik D. Demaine, Martin L. Demaine, Hirotaka Ono, Ryuhei Uehara, Duc A. Hoang

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/99985

zbMATH Keywords

independent setsliding token

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Reconfiguration of dominating sets ⋮ How to sort by walking and swapping on paths and trees ⋮ Token sliding on graphs of girth five ⋮ Token sliding on graphs of girth five ⋮ Unnamed Item ⋮ On girth and the parameterized complexity of token sliding and Token Jumping ⋮ Linear-time algorithm for sliding tokens on trees

This page was built for publication: Polynomial-Time Algorithm for Sliding Tokens on Trees