Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry
Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Proximity Drawability: a Survey
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Proximity drawings in polynomial area and volume
Computational Geometry: Theory and Applications
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Greedy drawings of triangulations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Some Results on Greedy Embeddings in Metric Spaces
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
Polynomial area bounds for MST embeddings of trees
GD'07 Proceedings of the 15th international conference on Graph drawing
A generalized greedy routing algorithm for 2-connected graphs
Theoretical Computer Science
Greedy routing via embedding graphs onto semi-metric spaces
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Schnyder greedy routing algorithm
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Succinct strictly convex greedy drawing of 3-connected plane graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A simple routing algorithm based on Schnyder coordinates
Theoretical Computer Science
Greedy routing via embedding graphs onto semi-metric spaces
Theoretical Computer Science
| Hi-index | 0.00 |
A greedy drawing is a graph drawing containing a distance-decreasing path for every pair of nodes. A path (v0,v1,...,vm) is distance-decreasing if d(vi,vm)d(vi−1,vm), for i=1,...,m. Greedy drawings easily support geographic greedy routing. Hence, a natural and practical problem is the one of constructing greedy drawings in the plane using few bits for representing vertex Cartesian coordinates and using the Euclidean distance as a metric. We show that there exist greedy-drawable graphs that do not admit any greedy drawing in which the Cartesian coordinates have less than a polynomial number of bits.