A time- and message-optimal distributed algorithm for minimum spanning trees
- Award ID(s):
- 1717075
- NSF-PAR ID:
- 10058622
- Date Published:
- Journal Name:
- ACM Symposium on Theory of Computing (STOC) 2017
- Page Range / eLocation ID:
- 743 to 756
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1145/3055399.3055449
