Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) 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)
Recommendations
Cites work
- Complexity of independent set reconfigurability problems
- Graph theory
- 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
- Reconfiguration over tree decompositions
- Reconfiguring independent sets in claw-free graphs
- Sliding token on bipartite permutation graphs
- Sliding tokens on a cactus
- The complexity of change
Cited in
(9)- Token sliding on chordal graphs
- Token sliding on split graphs
- Introduction to reconfiguration
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- Asynchronous sliding block maps
- Polynomial-time algorithm for sliding tokens on trees
- Sliding token on bipartite permutation graphs
- Sliding tokens on a cactus
- Computational complexity of puzzles and related topics
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)
