✦ LIBER ✦

A simple parallel tree contraction algorithm

✍ Scribed by K Abrahamson; N Dadoun; D.G Kirkpatrick; T Przytycka

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 952 KB
Volume: 10
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(89)90017-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Optimal Parallel Algorithm for

A Simple Optimal Parallel Algorithm for a Core of a Tree

✍ S.T. Peng; W.T. Lo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A core of a tree \(T=(V, E)\) is a path in \(T\) which minimizes \(\Sigma_{v \in V}\) \(d(v, P)\), where \(d(v, P)\), the distance from a vertex \(v\) to path \(P\), is defined as \(\min _{u \in P} d(v, u)\). We present an optimal parallel algorithm to find a core of \(T\) in \(O(\log n)\) time usin

A parallel tree difference algorithm

✍ D.B. Skillicorn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Parallel tree-contraction and Fibonacci

Parallel tree-contraction and Fibonacci numbers

✍ Wojciech Plandowski; Wojciech Rytter; Tomasz Szymacha 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 446 KB

A parallel alpha/beta tree searching alg

A parallel alpha/beta tree searching algorithm

✍ Robert M Hyatt; Bruce W Suter; Harry L Nelson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 688 KB

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