Token sliding on split graphs
From MaRDI portal
Publication:2048202
DOI10.1007/s00224-020-09967-8OpenAlexW3010964268MaRDI QIDQ2048202
Yota Otachi, Valia Mitsou, Michael Lampis, Rémy Belmonte, Eun Jung Kim, Florian Sikora
Publication date: 5 August 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.05322
Related Items (8)
Invitation to combinatorial reconfiguration ⋮ Reconfiguration of regular induced subgraphs ⋮ Token sliding on graphs of girth five ⋮ Parameterized complexity of multicut in weighted trees ⋮ Broadcasting in split graphs ⋮ On the complexity of distance-\(d\) independent set reconfiguration ⋮ Token sliding on graphs of girth five ⋮ On girth and the parameterized complexity of token sliding and Token Jumping
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of independent set reconfigurability problems
- Linear-time algorithm for sliding tokens on trees
- On the parameterized complexity of reconfiguration problems
- On the complexity of reconfiguration problems
- Token jumping in minor-closed classes
- Reconfiguration in bounded bandwidth and tree-depth
- Token sliding on chordal graphs
- Introduction to reconfiguration
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration of colorable sets in classes of perfect graphs
- The complexity of change
- Fixed-Parameter Tractability of Token Jumping on Planar Graphs
- Reconfiguring Independent Sets in Claw-Free Graphs
- Sliding Token on Bipartite Permutation Graphs
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- Sliding Tokens on a Cactus
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized Algorithms
This page was built for publication: Token sliding on split graphs
