An O(logn) Time Common CRCW PRAM Algorithm for Minimum Spanning Tree

An O(logn) Time Common CRCW PRAM Algorithm for Minimum Spanning Tree, 1992.

Cited by: 1|Views1
EI

Abstract:

We present a probabilistic algorithm for finding the minimum spanning tree of a graph with n vertices and m edges on a Common CRWC PRAM. It uses expected O(lognlog*n) time with (m+n) processors and expected O(logn) time with (m+n) logn processors. This represents a significant improvement in terms of efficiency over the previous best resu...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments