The following pages link to (Q4829018):
Displaying 15 items.
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- A parallel bio-inspired shortest path algorithm (Q2218449) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- (Q5115792) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- (Q5743390) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)