The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed geometrically, simply by having each vertex that receives M pass it along to any neighbor that is closer in the hyperbolic metric to the message's eventual destination. More importantly, for networking applications, our algorithm produces succinct drawings,arXiv:0806.0341v1 fatcat:wntdkv5slffxtftaz5rwrizbiq