Galactic token sliding
From MaRDI portal
Cites work
- A dichotomy theorem for circular colouring reconfiguration
- Complexity of independent set reconfigurability problems
- Deciding first-order properties of nowhere dense graphs
- Fixed-parameter tractability of token jumping on planar graphs
- Flip distance between two triangulations of a point set is NP-complete
- FPT algorithms for domination in sparse graphs and beyond
- Ground state connectivity of local Hamiltonians
- Homomorphism reconfiguration via homotopy
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 7803580 (Why is no real title available?)
- Introduction to reconfiguration
- Kernelization and approximation of distance-r independent sets on nowhere dense graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Linear-time algorithm for sliding tokens on trees
- On girth and the parameterized complexity of token sliding and token jumping
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized algorithms
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration on nowhere dense graph classes
- Reconfiguration on sparse graphs
- Reconfiguring independent sets in claw-free graphs
- Sliding token on bipartite permutation graphs
- The complexity of change
- The complexity of independent set reconfiguration on bipartite graphs
- Token jumping in minor-closed classes
- Token sliding on chordal graphs
- Token sliding on split graphs
This page was built for publication: Galactic token sliding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969674)
