Greedy routing via embedding graphs onto semi-metric spaces

DOI10.1016/J.TCS.2012.01.049MaRDI QIDQ388089zbMATHOpenAlexFDO

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

zbMATH Keywords

greedy routing3-connectivitygeometric routingmetric and semi-metric spaces

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 5764804 (Why is no real title available?)
• An Algorithm to Construct Greedy Drawings of Triangulations
• Bounded degree spanning trees (extended abstract)
• Distributed computation of virtual coordinates
• Graph theory with applications
• On a conjecture related to geometric routing
• On succinct convex greedy drawing of 3-connected plane graphs
• Some results on greedy embeddings in metric spaces
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct greedy drawings do not always exist
• Succinct greedy geometric routing in the Euclidean plane
• Trees in Polyhedral Graphs

Cited in

(8)

• On \(k\)-greedy routing algorithms
• Greedy Routing via Embedding Graphs onto Semi-metric Spaces
• An optimal greedy routing algorithm for triangulated polygons
• Space lower bounds for low-stretch greedy embeddings
• Space lower bounds for low-stretch greedy embeddings
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Some results on greedy embeddings in metric spaces
• Hyperbolic Embeddings for Near-Optimal Greedy Routing

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)