Sliding Tokens on Block Graphs

DOI10.1007/978-3-319-53925-6_36zbMath1485.68186OpenAlexW2588876993MaRDI QIDQ2980933

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

Mathematics Subject Classification ID

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

Related Items (1)

Introduction to reconfiguration

Cites Work

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

This page was built for publication: Sliding Tokens on Block Graphs