Pages that link to "Item:Q2946023"
From MaRDI portal
The following pages link to Reconfiguration over Tree Decompositions (Q2946023):
Displaying 15 items.
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Sliding Tokens on Block Graphs (Q2980933) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
