Invitation to combinatorial reconfiguration
From MaRDI portal
Publication:2154076
DOI10.1007/978-3-030-96731-4_3OpenAlexW4225678495MaRDI QIDQ2154076
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_3
Cites Work
- Unnamed Item
- A dichotomy theorem for circular colouring reconfiguration
- Complexity of independent set reconfigurability problems
- On the complexity of reconfiguration problems
- The \((n^ 2-1)\)-puzzle and related relocation problems
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- Reconfiguration in bounded bandwidth and tree-depth
- Token sliding on chordal graphs
- Token sliding on split graphs
- Introduction to reconfiguration
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- A Modern Treatment of the 15 Puzzle
- Independent Set Reconfiguration in Cographs and their Generalizations
- The complexity of change
- Vertex Cover Reconfiguration and Beyond
- The Complexity of Independent Set Reconfiguration on Bipartite Graphs
- Sliding Tokens on a Cactus
- Parameterized Complexity of Graph Constraint Logic
- Independent set reconfiguration parameterized by modular-width
- Reconfiguring Independent Sets on Interval Graphs
This page was built for publication: Invitation to combinatorial reconfiguration
