Pages that link to "Item:Q5435672"
From MaRDI portal
The following pages link to Compact oracles for reachability and approximate distances in planar digraphs (Q5435672):
Displaying 14 items.
- Search-space size in contraction hierarchies (Q306264) (← links)
- Succinct posets (Q329288) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- (Q5111733) (← links)
- (Q5115792) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Compact Routing in Unit Disk Graphs (Q6065413) (← links)
- Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)
- Implicit representation of relations (Q6185606) (← links)
