Galactic token sliding
From MaRDI portal
Publication:6098154
DOI10.1016/j.jcss.2023.03.008arXiv2204.05549OpenAlexW4365457937MaRDI QIDQ6098154
Amer E. Mouawad, Valentin Bartier, Nicolas Bousquet
Publication date: 12 June 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.05549
Related Items
Cites Work
- A dichotomy theorem for circular colouring reconfiguration
- Complexity of independent set reconfigurability problems
- Linear-time algorithm for sliding tokens on trees
- Flip distance between two triangulations of a point set is NP-complete
- Treewidth. Computations and approximations
- Token jumping in minor-closed classes
- Token sliding on chordal graphs
- Reconfiguration on sparse graphs
- On girth and the parameterized complexity of token sliding and Token Jumping
- Introduction to reconfiguration
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- The complexity of change
- Fixed-Parameter Tractability of Token Jumping on Planar Graphs
- Homomorphism reconfiguration via homotopy
- Reconfiguring Independent Sets in Claw-Free Graphs
- Ground State Connectivity of Local Hamiltonians
- Sliding Token on Bipartite Permutation Graphs
- The Complexity of Independent Set Reconfiguration on Bipartite Graphs
- Parameterized Complexity of Independent Set in H-Free Graphs.
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Galactic token sliding
