Pages that link to "Item:Q2805514"
From MaRDI portal
The following pages link to Maintaining shortest paths under deletions in weighted directed graphs (Q2805514):
Displaying 11 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- Dynamic approximate all-pairs shortest paths in undirected graphs (Q2910856) (← links)
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs (Q3082947) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time (Q5002715) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Maintaining shortest paths under deletions in weighted directed graphs (Q5495843) (← links)
- Parametric Shortest-Path Algorithms via Tropical Geometry (Q5868948) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5899451) (← links)