Succinct Greedy Geometric Routing in the Euclidean Plane
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 781-791
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- An Algorithm to Construct Greedy Drawings of TriangulationsLecture Notes in Computer Science, 2009
- Succinct Greedy Graph Drawing in the Hyperbolic PlaneLecture Notes in Computer Science, 2009
- On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations2008
- A Distributed Geometric Routing Algorithm for Ad HocWireless Networks2007
- On a conjecture related to geometric routingTheoretical Computer Science, 2005
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Optimum binary search treesActa Informatica, 1971