13 search results - page 1 / 3 » Generating Sparse Spanners for Weighted Graphs |
SWAT
1990
Springer
13 years 11 months ago
1990
Springer
ISAAC
2004
Springer
14 years 7 days 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...
WADS
2007
Springer
14 years 29 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
SIAMCOMP
2002
13 years 6 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...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...