𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient parallel algorithms for some graph theory problems

✍ Scribed by Jun Ma; Shaohan Ma


Book ID
112945695
Publisher
Springer
Year
1993
Tongue
English
Weight
292 KB
Volume
8
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Efficient Parallel Algorithms for Permut
✍ K. Arvind; V. Kamakoti; C.P. Rangan πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 641 KB

In this paper, we present optimal \(O(\log n)\) time, \(O(n / \log n)\) processor EREW PRAM parallel algorithms for finding the connected components, cut vertices, and bridges of a permutation graph. We also present an \(O(\log n)\) time, \(O(n)\) processor, CREW PRAM model parallel algorithm for fi