Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Distributed computation of virtual coordinates
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
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 Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Distributed computation of virtual coordinates for greedy routing in sensor networks
Discrete Applied Mathematics
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
Schnyder greedy routing algorithm
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Succinct greedy drawings do not always exist
GD'09 Proceedings of the 17th international conference on Graph Drawing
Category-based routing in social networks: Membership dimension and the small-world phenomenon
Theoretical Computer Science
| Hi-index | 0.00 |
We show an algorithm to construct greedy drawings of every given triangulation.