✦ LIBER ✦

Parallel algorithms for tree accumulations

✍ Scribed by Fatih E. Sevilgen; Srinivas Aluru; Natsuhiko Futamura

Book ID: 108191852
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 239 KB
Volume: 65
Category: Article
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2004.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for tree traversals

✍ N.C. Kalra; P.C.P. Bhatt 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Parallel Algorithms for Minimum Spanning

Parallel Algorithms for Minimum Spanning Tree Problem

✍ Ahrabian, H.; Nowzari-Dalini, A. 📂 Article 📅 2002 🏛 Taylor and Francis Group 🌐 English ⚖ 116 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

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

Faster bit-parallel algorithms for unord

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

✍ Yusaku Kaneta; Hiroki Arimura; Rajeev Raman 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Tree-Based Parallel Algorithm Design

✍ G. L. Miller; S. -H. Teng 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 236 KB