Sciweavers

659 search results - page 1 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
15 years 3 months ago
Small Stretch Spanners on Dynamic Graphs
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe...
CIAC
2003
Springer
145views Algorithms» more  CIAC 2003»
15 years 3 months ago
Additive Spanners for k-Chordal Graphs
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...
Victor Chepoi, Feodor F. Dragan, Chenyu Yan
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
61
Voted
ESA
2006
Springer
86views Algorithms» more  ESA 2006»
15 years 1 months ago
Dynamic Algorithms for Graph Spanners
Surender Baswana
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
14 years 10 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
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...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...