Pages that link to "Item:Q2921417"
From MaRDI portal
The following pages link to Robust Distance Queries on Massive Networks (Q2921417):
Displaying 13 items.
- Distributed distance measurement for large-scale networks. (Q1398827) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Sublinear search spaces for shortest path planning in grid and road networks (Q2230730) (← links)
- Distance Queries in Large-Scale Fully Dynamic Complex Networks (Q2819495) (← links)
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments (Q2828206) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- Reachability and Distance Queries via 2-Hop Labels (Q4429688) (← links)
- Fully Dynamic 2-Hop Cover Labeling (Q4629540) (← links)
- (Q5092347) (← links)
- Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind (Q5240227) (← links)
- ReHub (Q5266603) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- Efficient Point-to-Point Resistance Distance Queries in Large Graphs (Q5886033) (← links)