✦ LIBER ✦

Improved processor bounds for parallel algorithms for weighted directed graphs

✍ Scribed by Nancy Amato

Book ID: 103102787
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 648 KB
Volume: 45
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90017-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Dynamic Reachability Algorithms

Improved Dynamic Reachability Algorithms for Directed Graphs

✍ Roditty, Liam; Zwick, Uri 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 206 KB

Parallel algorithms for minimal spanning

Parallel algorithms for minimal spanning trees of directed graphs

✍ Yixin Zhang 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 570 KB

Improved Time and Parallel Processor Bou

Improved Time and Parallel Processor Bounds for Fortran-Like Loops

✍ Heuft, R.W.; Little, W.D. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 779 KB

A parallel search algorithm for directed

A parallel search algorithm for directed acyclic graphs

✍ Ratan K. Ghosh; G. P. Bhattacharjee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 860 KB

Bounds and asymptotic results for the un

Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

✍ S.T. Webster 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 269 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