Complexity of network synchronization
Journal of the ACM (JACM)
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
An Approximate L1-Difference Algorithm for Massive Data Streams
SIAM Journal on Computing
Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lower Bounds for Additive Spanners, Emulators, and More
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Dynamic algorithms for graph spanners
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Fully dynamic algorithm for graph spanners with poly-logarithmic update time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Streaming algorithm for graph spanners---single pass and constant processing time per edge
Information Processing Letters
Network synchronization with polylogarithmic overhead
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Graph Distances in the Data-Stream Model
SIAM Journal on Computing
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Small stretch spanners on dynamic graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Graph sketches: sparsification, spanners, and subgraphs
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We present a streaming algorithm for constructing sparse spanners and show that our algorithm significantly outperforms the state-of-the-art algorithm for this task (due to Feigenbaum et al.). Specifically, the processing time per edge of our algorithm is O(1), and it is drastically smaller than that of the algorithm of Feigenbaum et al., and all other efficiency parameters of our algorithm are no greater (and some of them are strictly smaller) than the respective parameters of the state-of-the-art algorithm. We also devise a fully dynamic centralized algorithm maintaining sparse spanners. This algorithm has incremental update time of O(1), and a nontrivial decremental update time. To our knowledge, this is the first fully dynamic centralized algorithm for maintaining sparse spanners that provides nontrivial bounds on both incremental and decremental update time for a wide range of stretch parameter t.