Greedy routing via embedding graphs onto semi-metric spaces

DOI10.1016/j.tcs.2012.01.049zbMath1325.05119OpenAlexW1989322785MaRDI 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

zbMATH Keywords

greedy routing3-connectivitygeometric routingmetric and semi-metric spaces

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

On \(k\)-greedy routing algorithms ⋮ An optimal greedy routing algorithm for triangulated polygons

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

This page was built for publication: Greedy routing via embedding graphs onto semi-metric spaces