Pages that link to "Item:Q5410654"
From MaRDI portal
The following pages link to On the Parameterized Complexity for Token Jumping on Graphs (Q5410654):
Displaying 20 items.
- Reconfiguration of dominating sets (Q346508) (← links)
- 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)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- (Q5090459) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- (Q6087216) (← links)
- Galactic token sliding (Q6098154) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- Hamiltonian cycle reconfiguration with answer set programming (Q6545539) (← links)
- Recongo: bounded combinatorial reconfiguration with answer set programming (Q6545541) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)
