Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners

被引:42
作者
Elkin, Michael [1 ]
机构
[1] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
关键词
Graph spanners; streaming algorithms; SPACE; TIME;
D O I
10.1145/1921659.1921666
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页数:17
相关论文
共 35 条
[1]   The space complexity of approximating the frequency moments [J].
Alon, N ;
Matias, Y ;
Szegedy, M .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (01) :137-147
[2]  
Ausiello G, 2005, LECT NOTES COMPUT SC, V3669, P532
[3]  
Awerbuch B., 1992, Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, P571, DOI 10.1145/129712.129768
[4]  
Awerbuch B., 1990, Proceedings. 31st Annual Symposium on Foundations of Computer Science (Cat. No.90CH2925-6), P514, DOI 10.1109/FSCS.1990.89572
[5]   COMPLEXITY OF NETWORK SYNCHRONIZATION [J].
AWERBUCH, B .
JOURNAL OF THE ACM, 1985, 32 (04) :804-823
[6]   ROUTING WITH POLYNOMIAL COMMUNICATION-SPACE TRADE-OFF [J].
AWERBUCH, B ;
PELEG, D .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992, 5 (02) :151-162
[7]  
Bar-Yossef Z, 2002, SIAM PROC S, P623
[8]  
Baswana S, 2003, LECT NOTES COMPUT SC, V2719, P384
[9]  
BASWANA S, 2006, ARXIVCS0611023
[10]  
BASWANA S, 2008, P 19 ANN S DISCR ALG, P672