Pages that link to "Item:Q392173"
From MaRDI portal
The following pages link to The complexity of rerouting shortest paths (Q392173):
Displaying 38 items.
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Shortest paths between shortest paths (Q719258) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- On the complexity of an optimal routing tree problem (Q1123140) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- The complexity of routing with few collisions (Q1679978) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles (Q2279287) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Reconfiguring (non-spanning) arborescences (Q2680989) (← links)
- Shortest Paths in One-Counter Systems (Q2811358) (← links)
- Independent set reconfiguration in cographs and their generalizations (Q2825488) (← links)
- A reconfigurations analogue of Brooks' theorem and its consequences (Q2833252) (← links)
- Link reversal routing with binary link labels: work complexity (Q2840988) (← links)
- Degree-Constrained Subgraph Reconfiguration is in P (Q2946420) (← links)
- Rerouting shortest paths in planar graphs (Q2957511) (← links)
- On the computational complexity of continuous routing (Q4203819) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
- (Q5026983) (← links)
- Shortest path reoptimization vs resolution from scratch: a computational comparison (Q5043855) (← links)
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges (Q5092443) (← links)
- Algorithms – ESA 2004 (Q5464573) (← links)
- Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
- Shifting paths to avoidable ones (Q6057583) (← links)
- The shortest path reconfiguration problem based on relaxation of reconfiguration rules (Q6575398) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
- Reconfiguring shortest paths in graphs (Q6623589) (← links)
- Reconfiguration of vertex-disjoint shortest paths on graphs (Q6637000) (← links)
