Paper Info
Title
Succinct Greedy Geometric Routing in the Euclidean Plane
Abstract
We show that greedy geometric routing schemes exist for the Euclidean metric in R 2, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(logn) bits, where n is the number of vertices in the graph.
Year
DOI
Venue
2009
10.1007/978-3-642-10631-6_79
ISAAC
Keywords
Field
DocType
euclidean plane,greedy geometric routing scheme,3-connected planar graph,succinct greedy geometric routing,computational geometry,planar graph
Graph drawing,Discrete mathematics,Geometric graph theory,Combinatorics,Spatial network,Slope number,Planar straight-line graph,Euclidean distance,Greedy coloring,Mathematics,Greedy embedding
Conference
Volume
ISSN
Citations 
5878
0302-9743
29
PageRank 
References 
Authors
1.15
29
2
Name
Order
Citations
PageRank
Michael T. Goodrich14351331.47
Darren Strash223817.72