Sciweavers

60 search results - page 3 / 12
» Construction of Minimum-Weight Spanners
Sort
View
OPODIS
2007
13 years 7 months ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
PROPERTYTESTING
2010
13 years 3 months ago
Transitive-Closure Spanners: A Survey
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
Sofya Raskhodnikova
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 5 months ago
On Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
Iyad A. Kanj, Ljubomir Perkovic
DCOSS
2009
Springer
13 years 10 months ago
Local Construction of Spanners in the 3-D Space
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...
Iyad A. Kanj, Ge Xia, Fenghui Zhang
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 10 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...