𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for realizing a layout of complete binary trees

✍ Scribed by Yumi Fukushima; Yoshihide Igarashi

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
606 KB
Volume
22
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A New Efficient Algorithm for Embedding
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
✍ Volker Heun; Ernst W. Mayr πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

Efficient Algorithms for Finding a Core
Efficient Algorithms for Finding a Core of a Tree with a Specified Length
✍ Shietung Peng; Win-tsung Lo πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 176 KB

A core of a graph G is a path P in G that is central with respect to the property to path P. This paper presents efficient algorithms for finding a core of a tree with Ε½ . a specified length. The sequential algorithm runs in O n log n time, where n is the Ε½ 2 . Ε½. size of the tree. The parallel alg