Succinct Greedy Geometric Routing Using Hyperbolic Geometry

DOI10.1109/TC.2010.257MaRDI QIDQ5280496zbMATH OpenOpenAlexFDO

Authors David Eppstein, Michael T. Goodrich

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2010.257

Mathematics Subject Classification ID

Hyperbolic and elliptic geometries (general) and generalizations (51M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(21)

• Geometric approach for optimal routing on a mesh with buses
• Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
• On the area requirements of planar greedy drawings of triconnected planar graphs
• Limitations on realistic hyperbolic graph drawing
• On planar greedy drawings of 3-connected planar graphs
• Every Schnyder drawing is a greedy embedding
• Euclidean greedy drawings of trees
• On a conjecture related to geometric routing
• Virtual coordinates in hyperbolic space based on Ricci flow for WLANs
• Greedy Routing via Embedding Graphs onto Semi-metric Spaces
• A simple routing algorithm based on Schnyder coordinates
• Properties of triangulations obtained by the longest-edge bisection
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Structural Information and Communication Complexity
• Greedy rectilinear drawings
• Drawing graphs as spanners
• Greedy rectilinear drawings
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Space lower bounds for low-stretch greedy embeddings

This page was built for publication: Succinct Greedy Geometric Routing Using Hyperbolic Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280496)