The following pages link to (Q4607915):
Displayed 22 items.
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- A substring-substring LCS data structure (Q1625599) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5088992) (← links)
- (Q5091049) (← links)
- (Q5092347) (← links)
- (Q5115792) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← 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)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
- (Q6179341) (← links)