Greedy routing via embedding graphs onto semi-metric spaces
From MaRDI portal
Publication:388089
DOI10.1016/J.TCS.2012.01.049zbMATH Open1325.05119OpenAlexW1989322785MaRDI QIDQ388089FDOQ388089
Authors: Huaming Zhang, Swetha Govindaiah 
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
Recommendations
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces
- Some results on greedy embeddings in metric spaces
- On succinct convex greedy drawing of 3-connected plane graphs
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- An optimal greedy routing algorithm for triangulated polygons
Graph representations (geometric and intersection representations, etc.) (05C62) Network design and communication in computer systems (68M10)
Cites Work
- Graph theory with applications
- On a conjecture related to geometric routing
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Succinct greedy geometric routing in the Euclidean plane
- Some results on greedy embeddings in metric spaces
- Bounded degree spanning trees (extended abstract)
- Succinct greedy drawings do not always exist
- Title not available (Why is that?)
- Distributed computation of virtual coordinates
- On succinct convex greedy drawing of 3-connected plane graphs
- Trees in Polyhedral Graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
Cited In (8)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- On \(k\)-greedy routing algorithms
- Some results on greedy embeddings in metric spaces
- Space lower bounds for low-stretch greedy embeddings
- Space lower bounds for low-stretch greedy embeddings
- An optimal greedy routing algorithm for triangulated polygons
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces
This page was built for publication: Greedy routing via embedding graphs onto semi-metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388089)
