scientific article; zbMATH DE number 7559122
From MaRDI portal
Publication:5090459
DOI10.4230/LIPIcs.STACS.2019.13MaRDI QIDQ5090459
Valia Mitsou, Michael Lampis, Eun Jung Kim, Florian Sikora, Rémy Belmonte, Yota Otachi
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Reconfiguration of colorable sets in classes of perfect graphs ⋮ Galactic token sliding ⋮ Unnamed Item ⋮ Reconfiguration of Spanning Trees with Many or Few Leaves ⋮ Reconfiguring spanning and induced subgraphs ⋮ Independent set reconfiguration parameterized by modular-width
Cites Work
- 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
- 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
- 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
- Sliding Tokens on a Cactus
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized Algorithms
This page was built for publication:
