A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities

Michael Elkin. A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities. Journal of the ACM, 67(2), 2020. [doi]

@article{Elkin20,
  title = {A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities},
  author = {Michael Elkin},
  year = {2020},
  doi = {10.1145/3380546},
  url = {https://doi.org/10.1145/3380546},
  researchr = {https://researchr.org/publication/Elkin20},
  cites = {0},
  citedby = {0},
  journal = {Journal of the ACM},
  volume = {67},
  number = {2},
}