659 search results - page 2 / 132 » Dynamic Algorithms for Graph Spanners |
COMGEO
1999
ACM
13 years 7 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
COMPGEOM
2004
ACM
14 years 26 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
CCCG
2010
13 years 9 months ago
2010
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...