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
Citácia podle Chicago (17th ed.)Mashreghi, Ali, a 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.
Citácia podľa MLA (8th ed.)Mashreghi, Ali, a 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.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..