Pages that link to "Item:Q5212755"
From MaRDI portal
The following pages link to Almost optimal distance oracles for planar graphs (Q5212755):
Displaying 16 items.
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Connectivity Oracles for Planar Graphs (Q2904567) (← links)
- Compact Oracles for Approximate Distances Around Obstacles in the Plane (Q3527228) (← links)
- Fast and Compact Oracles for Approximate Distances in Planar Graphs (Q3527255) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5918687) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5970820) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)