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

Optimal multiway search trees for variable size keys

โœ Scribed by Jayme Luiz Szwarcfiter

Publisher
Springer-Verlag
Year
1984
Tongue
English
Weight
656 KB
Volume
21
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An optimal EREW parallel algorithm for c
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
โœ H.S. Chao; F.R. Hsu; R.C.T. Lee ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 498 KB

Given a undirected graph G, the breadth-first search tree is constructed by a breadth-first search on G. In this paper, an optimal parallel algorithm is presented for constructing the breadth-first search tree for permutation graphs in O(log n) time by using O(n/Iog n) processors under the EREW PRAM

An optimal tree search method for the ma
An optimal tree search method for the manufacturing systems cell formation problem
โœ K. Spiliopoulos; S. Sofianopoulou ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 849 KB

A solution methodology producing exact solutions to the manufacturing systems cell formation problem is presented. A distance matrix representing the closeness between pairs of machines with regard to the parts they process is taken into account. The proposed approach is an optimal tree search metho