Invitation to combinatorial reconfiguration

DOI10.1007/978-3-030-96731-4_3MaRDI QIDQ2154076zbMATH OpenOpenAlexFDO

Authors Takehiro Ito

Publication date 13 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-96731-4_3

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A dichotomy theorem for circular colouring reconfiguration
• A Modern Treatment of the 15 Puzzle
• A simple proof that the \((n^{2} - 1)\)-puzzle is hard
• Complexity of independent set reconfigurability problems
• Games, puzzles, and computation
• Independent set reconfiguration in cographs and their generalizations
• Introduction to reconfiguration
• On the complexity of reconfiguration problems
• Parameterized complexity of graph constraint logic
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Reconfiguration in bounded bandwidth and tree-depth
• Reconfiguring Independent Sets on Interval Graphs
• Sliding tokens on a cactus
• The \((n^ 2-1)\)-puzzle and related relocation problems
• The complexity of change
• The complexity of independent set reconfiguration on bipartite graphs
• Token sliding on chordal graphs
• Token sliding on split graphs
• Vertex Cover Reconfiguration and Beyond

Cited in

(1)

• Invitation to composition

This page was built for publication: Invitation to combinatorial reconfiguration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154076)