Creating Optimal Distributed Algorithms for Minimum Spanning Trees

This paper examines the complexity of distributed algorithms for nding a Minimum Spanning Tree in undirected graphs; the goal is to create algorithms optimal with respect to both communication O(E + N logN) and time O(N), where E; N is the number of edges and nodes respectively. A fundamental bad case that leads to non-optimal performance and the proposed… CONTINUE READING