Summary of "A Distributed Algorithm for Minimum-Weight Spanning Trees"
Janne Lindqvist · 2005
This document summarizes the article published by Gallagerher et. al on “A Distributed Algorithm for Minimum-Weight Spanning Trees”. The asynchronous distributed algorithm determines a minimum-weight spanning tree for an undirected graph that has distinct finite weights for every edge. 1