Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model

Ali Mashreghi, Valerie King. Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model. In Ulrich Schmid 0001, Josef Widder, editors, 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018. Volume 121 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.