Vladmir Lončar

Learn More
In this paper we study parallel algorithms for finding minimum spanning tree of a graph. We present two algorithms, based on sequential algorithms of Prim and Kruskal, targeting message passing parallel machine with distributed memory. First algorithm runs in O(n<sup>2</sup>=p+n log p) and second algorithm runs in O(n<sup>2</sup>=p + n<sup>2</sup> log p).
  • 1