Greedy routing via embedding graphs onto semi-metric spaces
From MaRDI portal
Publication:388089
DOI10.1016/j.tcs.2012.01.049zbMath1325.05119MaRDI QIDQ388089
Swetha Govindaiah, Huaming Zhang
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.049
68M10: Network design and communication in computer systems
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on greedy embeddings in metric spaces
- Bounded degree spanning trees (extended abstract)
- On a conjecture related to geometric routing
- Succinct Greedy Drawings Do Not Always Exist
- Distributed computation of virtual coordinates
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Succinct Greedy Geometric Routing in the Euclidean Plane
- Trees in Polyhedral Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations