Efficient computation of distance sketches in distributed networks

Atish Das Sarma, Michael Dinitz, Gopal Pandurangan. Efficient computation of distance sketches in distributed networks. In Guy E. Blelloch, Maurice Herlihy, editors, 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. pages 318-326, ACM, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.