๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel tree difference algorithm

โœ Scribed by D.B. Skillicorn

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
455 KB
Volume
60
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simple parallel tree contraction algor
A simple parallel tree contraction algorithm
โœ K Abrahamson; N Dadoun; D.G Kirkpatrick; T Przytycka ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 952 KB
Parallel algorithms for tree traversals
Parallel algorithms for tree traversals
โœ N.C. Kalra; P.C.P. Bhatt ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 382 KB
A Parallel Algorithm for Computing Minim
A Parallel Algorithm for Computing Minimum Spanning Trees
โœ D.B. Johnson; P. Metaxas ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i