Succinct Greedy Graph Drawing in the Hyperbolic PlaneEppstein, David and Goodrich, Michael T. (2009) Succinct Greedy Graph Drawing in the Hyperbolic Plane. In: Graph Drawing 16th International Symposium, GD 2008, September 21 24, 2008 , pp. 1425(Official URL: http://dx.doi.org/10.1007/9783642002199_3). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783642002199_3
AbstractWe describe a method for producing a greedy embedding of any n vertex simple graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that is closer to M ’s destination. Our algorithm produces succinct drawings, where vertex positions are represented using O(log n) bits and distance comparisons may be performed efﬁciently using these representations.
Actions (login required)
