✦ LIBER ✦

Parallel algorithms for tree traversals

✍ Scribed by N.C. Kalra; P.C.P. Bhatt

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 382 KB
Volume: 2
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(85)90026-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Morris' tree traversal algorithm reconsi

Morris' tree traversal algorithm reconsidered

✍ Prabhaker Mateti; Ravi Manghirmalani 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 813 KB

Efficient Parallel Algorithms for Graphs

Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

✍ Jens Lagergren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ž 3 . Ž. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ž 2 . position algorithm is O O n log n . The tree-decomposi

Breadth-first traversal of trees and int

Breadth-first traversal of trees and integer sorting in parallel

✍ Calvin C.-Y. Chen; Sajal K. Das 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Parallel tree-projection-based sequence

Parallel tree-projection-based sequence mining algorithms

✍ Valerie Guralnik; George Karypis 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Cost-optimal parallel algorithms for con

Cost-optimal parallel algorithms for constructing B-trees

✍ Wang Biing-Feng; Chen Gen-Huey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 884 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