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

Ajieren, Eric; Hourani, Khalid; Moses Jr., William K.; Pandurangan, Gopal

doi:10.1145/3491003.3491011

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

Ajieren, Eric; Hourani, Khalid; Moses Jr., William K.; Pandurangan, Gopal

Authors

Eric Ajieren

Khalid Hourani

Dr Billy Moses Jr william.k.moses-jr@durham.ac.uk
Assistant Professor

Gopal Pandurangan

Citation

Ajieren, E., Hourani, K., Moses Jr., W. K., & Pandurangan, G. (2022). Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation. . https://doi.org/10.1145/3491003.3491011

Conference Name	23rd International Conference on Distributed Computing and Networking
Publication Date	2022
Deposit Date	Dec 6, 2022
Pages	40-49
ISBN	9781450395601
DOI	https://doi.org/10.1145/3491003.3491011

Awake Complexity of Distributed Minimum Spanning Tree (2024)
Conference Proceeding

Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd (2024)
Conference Proceeding

Time- and Communication-Efficient Overlay Network Construction via Gossip (2023)
Conference Proceeding

Efficient live exploration of a dynamic ring with mobile robots (2023)
Journal Article

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots (2023)
Conference Proceeding

Downloadable Citations

HTML

BIB

RTF

Authors

Citation

You might also like

Downloadable Citations