Pages that link to "Item:Q719258"
From MaRDI portal
The following pages link to Shortest paths between shortest paths (Q719258):
Displayed 25 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 on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles (Q2279287) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← 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)
- (Q5026983) (← links)
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges (Q5092443) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- On reconfiguration graphs of independent sets under token sliding (Q6115427) (← links)
- Extremal independent set reconfiguration (Q6133144) (← links)