A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners
<|reference_start|>A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners: 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.<|reference_end|>
@article{elkin2006a,
    title={A near-optimal fully dynamic distributed algorithm for maintaining
  sparse spanners},
    author={Michael Elkin},
    journal={arXiv preprint arXiv:cs/0611001},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0611001},
    primaryClass={cs.DS}
}