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 10 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)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← 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)
