Compact routing schemes with low stretch factor
From MaRDI portal
Recommendations
Cited in
(29)- A survey on interval routing
- On the complexity of multi-dimensional interval routing schemes
- On efficient distributed construction of near optimal routing schemes
- Interval routing in reliability networks
- The complexity of the characterization of networks supporting shortest-path interval routing.
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Near-optimal induced universal graphs for cycles and paths
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Low-congestion shortcuts without embedding
- Fault-Tolerant Compact Routing Schemes for General Graphs
- Improved routing strategies with succinct tables
- Adjacency labeling schemes and induced-universal graphs
- Routing in polygonal domains
- Compact and localized distributed data structures
- Space-efficient path-reporting approximate distance oracles
- Compact routing with slack
- Compact roundtrip routing with topology-independent node names
- Space-efficiency for routing schemes of stretch factor three
- Close to linear space routing schemes
- Compact Routing in Unit Disk Graphs
- Certification of compact low-stretch routing schemes
- Routing among convex polygonal obstacles in the plane
- Distance labeling for families of cycles
- Closing the gap: minimum space optimal time distance labeling scheme for interval graphs
- \(f\)-sensitivity distance oracles and routing schemes
- Compact routing schemes for dynamic ring networks
- Average stretch analysis of compact routing schemes
- Fast deterministic distributed algorithms for sparse spanners
This page was built for publication: Compact routing schemes with low stretch factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808315)
