๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal parallel algorithm for merging using multiselection

โœ Scribed by Narsingh Deo; Amit Jain; Muralidhar Medidi

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
654 KB
Volume
50
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Optimal Parallel Matching Algorithm f
An Optimal Parallel Matching Algorithm for Cographs
โœ R. Lin; S. Olariu ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v

An Optimal Shortest Path Parallel Algori
An Optimal Shortest Path Parallel Algorithm for Permutation Graphs
โœ O.H. Ibarra; Q. Zheng ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f

Optimal Parallel Algorithms for Quadtree
Optimal Parallel Algorithms for Quadtree Problems
โœ S. Kasif ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science โš– 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc