Pages that link to "Item:Q719258"
From MaRDI portal
The following pages link to Shortest paths between shortest paths (Q719258):
Displayed 11 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)