659 search results - page 7 / 132 » Dynamic Algorithms for Graph Spanners |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
SIAMCOMP
2002
14 years 11 months ago
2002
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...
SWAT
1990
Springer
15 years 3 months ago
1990
Springer
ESA
2008
Springer
15 years 1 months ago
2008
Springer
116
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...