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

A fast distributed approximation algorithm for minimum spanning trees

โœ Scribed by Maleq Khan; Gopal Pandurangan

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
271 KB
Volume
20
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A distributed algorithm for constructing
A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks
โœ Thilmee M. Baduge; Akihito Hiromori; Hirozumi Yamaguchi; Teruo Higashino ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 787 KB

## Abstract In this paper, we propose a new protocol that constructs a spanning tree on an overlay network given by a complete graph, in a decentralized manner. This algorithm consists of two decentralized operations, which support joining of and leaving of the overlay network at any time in the se