Pages that link to "Item:Q2816298"
From MaRDI portal
The following pages link to Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298):
Displaying 12 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Maintaining shortest paths under deletions in weighted directed graphs (Q2805514) (← 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)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds (Q5146947) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5925609) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5972260) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)