659 search results - page 1 / 132 » Dynamic Algorithms for Graph Spanners |
ESA
2005
Springer
15 years 4 months ago
2005
Springer
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...
101
click to vote
CIAC
2003
Springer
15 years 4 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...
ISAAC
2004
Springer
15 years 4 months ago
2004
Springer
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...
ESA
2006
Springer
15 years 2 months ago
2006
Springer
106
click to vote
ALGORITHMICA
2002
14 years 10 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...