Sliding tokens on block graphs
From MaRDI portal
Publication:2980933
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)
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
- Polynomial-time algorithm for sliding tokens on trees
- Token sliding on split graphs
- Introduction to reconfiguration
- Sliding tokens on a cactus
- Sliding token on bipartite permutation graphs
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- 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)
