A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners

Michael Elkin. A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In Indranil Gupta, Roger Wattenhofer, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. pages 185-194, ACM, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.