MST construction in O(log log n) communication rounds


We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(log n) bits. For this model, we present a distributed algorithm that constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to each other… (More)
DOI: 10.1145/777412.777428


  • Presentations referencing similar topics