Pages that link to "Item:Q3527255"
From MaRDI portal
The following pages link to Fast and Compact Oracles for Approximate Distances in Planar Graphs (Q3527255):
Displaying 12 items.
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Compact Oracles for Approximate Distances Around Obstacles in the Plane (Q3527228) (← links)
- Engineering Route Planning Algorithms (Q3637315) (← links)
- (Q4829018) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Almost optimal distance oracles for planar graphs (Q5212755) (← links)
- Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314) (← links)
- A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs (Q5363094) (← links)
- Compact oracles for reachability and approximate distances in planar digraphs (Q5435672) (← links)
- (Q5501268) (← links)