Compact Routing in Unit Disk Graphs
From MaRDI portal
Publication:6065413
DOI10.4230/lipics.isaac.2020.16OpenAlexW3113568187MaRDI QIDQ6065413
Publication date: 14 November 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.ISAAC.2020.16
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact and low delay routing labeling scheme for unit disk graphs
- Unit disk graphs
- Routing in unit disk graphs
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Compact Routing with Minimum Stretch
- New Routing Techniques and their Applications
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Improved routing strategies with succinct tables
- Labelling and Implicit Routing in Networks
- A trade-off between space and efficiency for routing tables
- Compact routing schemes with low stretch factor
- Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension
- Routing in Polygonal Domains
- Compact routing schemes with improved stretch
- Compact oracles for reachability and approximate distances in planar digraphs
- Close to linear space routing schemes
This page was built for publication: Compact Routing in Unit Disk Graphs
