The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
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...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...