A Parallel Algorithm for Computing Minimum Spanning Trees


We present a simple and implementable algorithm that computes a min imum spanning tree of an undirected weighted graph G V E of n jV j vertices andm jEj edges on an EREW PRAM in O log n time using n m processors This represents a substantial improvement in the running time over the previous results for this problem using at the same time the weakest of the… (More)
DOI: 10.1145/140901.141917


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics