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

The Complexity and Algorithm for Minimum Expense Spanning Trees

โœ Scribed by Zhan Ning; Wu Longshu

Book ID
119356127
Publisher
Elsevier
Year
2012
Tongue
English
Weight
203 KB
Volume
29
Category
Article
ISSN
1877-7058

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for Finding K Minimum Spann
An Algorithm for Finding K Minimum Spanning Trees
โœ Katoh, N.; Ibaraki, T.; Mine, H. ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 964 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