Pages that link to "Item:Q5171228"
From MaRDI portal
The following pages link to Distance Oracles for Sparse Graphs (Q5171228):
Displaying 14 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- An introduction to the Ribe program (Q1936714) (← links)
- Ultrametric subsets with large Hausdorff dimension (Q1949226) (← links)
- Preprocess, set, query! (Q2017874) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Distance Oracles for Vertex-Labeled Graphs (Q3012943) (← links)
- On Approximate Distance Labels and Routing Schemes with Affine Stretch (Q3095345) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- (Q5743390) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5925609) (← links)
- Close to linear space routing schemes (Q5964899) (← links)
