178 search results - page 1 / 36 » Constructing the Spanners of Graphs in Parallel |
96
Voted
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
163
click to vote
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
168
click to vote
CIAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
161
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
185
click to vote
ICDCS
2002
IEEE
15 years 10 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...