The Distributed Minimum Spanning Tree Problem
Bulletin of the EATCS, Volume 125, 2018.
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...More
Full Text (Upload PDF)
PPT (Upload PPT)