GHS Algorithm
The GHS algorithm of Gallager, Humblet and Spira is one of the best-known algorithms in distributed computing theory. This algorithm can construct the MST in asynchronous Message-passing model.
Read more about this topic: Distributed Minimum Spanning Tree