Reconfiguration of labeled matchings in triangular grid graphs
From MaRDI portal
Cites work
- \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- Approximation and hardness of token swapping
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of token swapping and its variants
- Galactic token sliding
- Games, puzzles, and computation
- Hamiltonian properties of triangular grid graphs
- Hardness of token swapping on trees
- scientific article; zbMATH DE number 7765391 (Why is no real title available?)
- Inapproximability of shortest paths on perfect matching polytopes
- Introduction to reconfiguration
- Linear-time algorithm for sliding tokens on trees
- Matching theory
- Note on the ``15 puzzle.
- On the complexity of reconfiguration problems
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Shortest reconfiguration of perfect matchings via alternating cycles
- Sorting on graphs by adjacent swaps using permutation groups
- The complexity of change
- The diameter of the fractional matching polytope and its hardness implications
- The Perfect Matching Reconfiguration Problem
This page was built for publication: Reconfiguration of labeled matchings in triangular grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260663)
