A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners
数据结构与算法
2009-09-29 v1
摘要
In this paper we devise an extremely efficient fully dynamic distributed algorithm for maintaining sparse spanners. Our resuls also include the first fully dynamic centralized algorithm for the problem with non-trivial bounds for both incremental and decremental update. Finally, we devise a very efficient streaming algorithm for the problem.
引用
@article{arxiv.cs/0611001,
title = {A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners},
author = {Michael Elkin},
journal= {arXiv preprint arXiv:cs/0611001},
year = {2009}
}