๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Efficient Parallel Algorithms for Graphs
โœ 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