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

Parallel algorithm for computing fixpoints of Galois connections

โœ Scribed by Petr Krajca; Jan Outrata; Vilem Vychodil

Publisher
Springer Netherlands
Year
2010
Tongue
English
Weight
700 KB
Volume
59
Category
Article
ISSN
1012-2443

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