Fixed-parameter algorithms for graph constraint logic
From MaRDI portal
Publication:6089660
Recommendations
- Fixed-parameter algorithms for graph constraint logic
- Parameterized complexity of graph constraint logic
- scientific article; zbMATH DE number 2086639
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond
Cites work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of independent set reconfigurability problems
- Diameter of colorings under Kempe changes
- Introduction to reconfiguration
- On the complexity of reconfiguration problems
- PSPACE-completeness of Bloxorz and of games with 2-buttons
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Parameterized complexity of graph constraint logic
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Proof equivalence in MLL is PSPACE-complete
- Reconfiguring undirected paths
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- The complexity of change
- The complexity of dominating set reconfiguration
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
Cited in
(2)
This page was built for publication: Fixed-parameter algorithms for graph constraint logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089660)
