Fully Sequential and Distributed Dynamic Algorithms for Minimum Spanning Trees

Pradosh Kumar Mohapatra

In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST…