Pradosh Kumar Mohapatra

Learn More
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 algorithm is to update eeciently the minimum spanning tree after dynamic changes like edge weight changes, rather than having to recompute it from scatch each time. The rst part(More)
  • 1