The Distributed Minimum Spanning Tree Problem

Gopal Pandurangan, Peter Robinson, Michele Scquizzato
2018 Bulletin of the European Association for Theoretical Computer Science  
This article surveys the distributed minimum spanning tree (MST) problem, a central and one of the most studied problems in distributed computing. In this problem, we are given a network, represented as a weighted graph G = (V, E), and the nodes in the network communicate by message passing via the edges of G with the goal of constructing an MST of G in a distributed fashion, i.e., each node should identify the MST edges incident to itself. This article summarizes the long line of research in
more » ... signing efficient distributed algorithms and showing lower bounds for the distributed MST problem, including the most recent developments which have focused on algorithms that are simultaneously round-and message-optimal.
dblp:journals/eatcs/Pandurangan0S18 fatcat:2gsu4hkhq5bvbbydiwmp6osppi