Mashreghi, A., & King, V. (2021). Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model. Distributed computing, 34(4), 283-299. https://doi.org/10.1007/s00446-020-00387-y
Chicago Style (17th ed.) CitationMashreghi, Ali, and Valerie King. "Broadcast and Minimum Spanning Tree with O(m) Messages in the Asynchronous CONGEST Model." Distributed Computing 34, no. 4 (2021): 283-299. https://doi.org/10.1007/s00446-020-00387-y.
MLA (9th ed.) CitationMashreghi, Ali, and Valerie King. "Broadcast and Minimum Spanning Tree with O(m) Messages in the Asynchronous CONGEST Model." Distributed Computing, vol. 34, no. 4, 2021, pp. 283-299, https://doi.org/10.1007/s00446-020-00387-y.
Warning: These citations may not always be 100% accurate.