Pages that link to "Item:Q1999961"
From MaRDI portal
The following pages link to Faster approximate diameter and distance oracles in planar graphs (Q1999961):
Displaying 9 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Fast and Compact Oracles for Approximate Distances in Planar Graphs (Q3527255) (← links)
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs (Q4629989) (← links)
- (Q4829018) (← links)
- Approximating the Diameter of Planar Graphs in Near Linear Time (Q4962209) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Almost optimal distance oracles for planar graphs (Q5212755) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)