Pages that link to "Item:Q719258"

The following pages link to Shortest paths between shortest paths (Q719258):

Displaying 38 items.

• Finding shortest paths between graph colourings (Q309791) (← links)
• Reconfiguration of dominating sets (Q346508) (← links)
• Shortest path through random points (Q350693) (← 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)
• Shortest descending paths through given faces (Q1025303) (← 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)
• Shortest paths in reachability graphs (Q1900935) (← 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)
• All pairs lightest shortest paths (Q2819534) (← 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)
• Rerouting shortest paths in planar graphs (Q2957511) (← links)
• Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
• (Q3835329) (← links)
• (Q5026983) (← links)
• Reconfiguration of Minimum Steiner Trees via Vertex Exchanges (Q5092443) (← links)
• Shortest Paths Avoiding Forbidden Subpaths (Q5389966) (← links)
• (Q5844704) (← 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)
• Computational complexity of jumping block puzzles (Q6144017) (← links)
• The shortest path reconfiguration problem based on relaxation of reconfiguration rules (Q6575398) (← links)
• Reconfiguring shortest paths in graphs (Q6623589) (← links)
• Reconfiguration of vertex-disjoint shortest paths on graphs (Q6637000) (← links)