Sliding tokens on block graphs

DOI10.1007/978-3-319-53925-6_36zbMATH Open1485.68186OpenAlexW2588876993MaRDI QIDQ2980933FDOQ2980933

Authors: Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara 

Publication date: 5 May 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_36

Recommendations

• Sliding tokens on a cactus
• Linear-time algorithm for sliding tokens on trees
• Token sliding on chordal graphs
• Polynomial-time algorithm for sliding tokens on trees
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Graph theory
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• The complexity of change
• Reconfiguring Independent Sets in Claw-Free Graphs
• Complexity of independent set reconfigurability problems
• On the complexity of reconfiguration problems
• Reconfiguration over Tree Decompositions
• Linear-time algorithm for sliding tokens on trees
• Sliding Token on Bipartite Permutation Graphs
• Sliding Tokens on a Cactus

Cited In (4)

• Token sliding on split graphs
• Introduction to reconfiguration
• Computational complexity of puzzles and related topics
• Asynchronous sliding block maps

This page was built for publication: Sliding tokens on block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980933)