Sciweavers

Share
7 search results - page 1 / 2
» Small Stretch Spanners on Dynamic Graphs
Sort
View
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
10 years 20 days 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...
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
10 years 1 months ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer
ICALP
2007
Springer
10 years 1 months ago
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs signi´Čücantly the state-of-the-art algorithm for this task [20]. Speci´Č...
Michael Elkin
COMGEO
1999
ACM
9 years 6 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
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...
Sunil Arya, David M. Mount, Michiel H. M. Smid
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
9 years 11 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (╬▒, ╬▓)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor ╬▒ and an additive error ╬▓, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
books