Sciweavers

CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 5 months ago
Communication-Efficient Construction of the Plane Localized Delaunay Graph
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Dam...