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

A new parallel algorithm for rooting a tree

โœ Scribed by Kim, Taenam ;Oh, Dukhwan ;Lim, Eunki

Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
101 KB
Volume
5
Category
Article
ISSN
1226-0061

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel tree difference algorithm
A parallel tree difference algorithm
โœ D.B. Skillicorn ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 455 KB
A parallel algorithm for tree pattern ma
A parallel algorithm for tree pattern matching
โœ Koji Tarora; Tomio Hirata; Yasuyoshi Inagaki ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 814 KB

## Abstract Given a text tree __t__ and a pattern tree __p__, tree pattern matching involves finding subtrees of __t__ which match __p.__ This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in __O__(log __n__) parallel time using __mn__/log__n__ proc

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
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