Succinct Greedy Geometric Routing Using Hyperbolic Geometry

DOI10.1109/TC.2010.257zbMath1368.68122OpenAlexW2116778777MaRDI QIDQ5280496

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)

Related Items

Virtual coordinates in hyperbolic space based on Ricci flow for WLANs, Limitations on realistic hyperbolic graph drawing, Euclidean greedy drawings of trees, Properties of triangulations obtained by the longest-edge bisection, Space lower bounds for low-stretch greedy embeddings, Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications, On succinct greedy drawings of plane triangulations and 3-connected plane graphs, On the area requirements of planar greedy drawings of triconnected planar graphs, Greedy rectilinear drawings, On planar greedy drawings of 3-connected planar graphs, Greedy rectilinear drawings, Every Schnyder drawing is a greedy embedding, Drawing graphs as spanners, NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs, Hyperbolic Embeddings for Near-Optimal Greedy Routing