𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algorithms on graphs

✍ Scribed by E. A. Ivanov

Publisher
Springer US
Year
1982
Tongue
English
Weight
339 KB
Volume
17
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel algorithms for parity graphs
Parallel algorithms for parity graphs
✍ T Przytycka; D.G Corneil πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 782 KB
Parallel Algorithms for Reducible Flow G
Parallel Algorithms for Reducible Flow Graphs
✍ Vijaya Ramachandran πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 324 KB

We present parallel NC algorithms for recognizing a reducible flow graph rfg and for finding dominators, minimum feedback vertex sets, and a depth first search Ε½ . tree in an rfg. On an n-node rfg, all of these algorithms run in polylog n time Ε½ . Ε½ . using M n processors, where M n is the number o

Efficient Parallel Algorithms for Permut
Efficient Parallel Algorithms for Permutation Graphs
✍ 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