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]. Specifically, the processing time-per-edge of our algorithm is drastically smaller than that of the algorithm of [20], and all other efficiency parameters of our algorithm are no greater (and some of them are strictly smaller) than the respective parameters for the state-of-the-art algorithm. We also devise a fully dynamic centralized algorithm maintaining sparse spanners. This algorithm has a very small incremental update time, and a non-trivial decremental update time. To our knowledge, this is the first fully dynamic centralized algorithm for maintaining sparse spanners that provides non-trivial bounds on both incremental and decre-mental update time for a wide range of stretch parameter t. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Elkin, M. (2007). Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 716–727). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_62
Mendeley helps you to discover research relevant for your work.