Browsing by Subject "1-bit memory local routing algorithm"
Now showing items 1-1 of 1
-
Local geometric routing algorithms for edge-augmented planar graphs
(2013-09-20)Given a geometric graph G = (V,E), where V is the set of vertices and E is the set of edges and a source-target pair {s,t} is a subset of V, a local geometric routing algorithm seeks a route from s to t using only local ...