The following pages link to (Q5743389):
Displaying 11 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs (Q4990395) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Optimal (Euclidean) Metric Compression (Q5080486) (← links)
- (Q5091203) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- Close to linear space routing schemes (Q5964899) (← links)
