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

An optimal parallel algorithm for generating combinations

โœ Scribed by Selim G. Akl; David Gries; Ivan Stojmenovic

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
675 KB
Volume
33
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 Systolic Algorithm for Genera
An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order
โœ S.G. Akl; H. Meijer; I. Stojmenovic ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 693 KB

A systolic algorithm is described for generating all permutations of \(n\) elements in lexicographic order. The algorithm is designed to be executed on a linear array of \(n\) processors, each having constant size memory, and each being responsible for producing one element of a given permutation. T

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