Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation

Award ID(s):: 1633720

NSF-PAR ID:: 10387806

Author(s) / Creator(s):: Ajieren, Eric; Hourani, Khalid; Moses Jr., William K.; Pandurangan, Gopal

Date Published:: 2022-01-01

Journal Name:: ICDCN 2022: 23rd International Conference on Distributed Computing and Networking

Page Range / eLocation ID:: 40 to 49

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1145/3491003.3491011