Abstract
Three algorithms are given to construct a weighted r-ary tree with a given set of integer weighted leaves in which the weight of a parent node is 1 + max of its sons. Two goals are of interest; to minimize 1) the weight of the root of the tree, and 2) the number of internal nodes. Formulas for the optimum values of 1) and 2) are presented. We show that the first algorithm simultaneously optimizes both 1) and 2), the second only 2) while nearly optimizing 1), and the third op-
Original language | English |
---|---|
Pages (from-to) | 1164-1167 |
Number of pages | 4 |
Journal | IEEE Transactions on Computers |
Volume | C-25 |
Issue number | 11 |
DOIs | |
State | Published - Nov 1976 |
Externally published | Yes |
Keywords
- Fan-in
- integer weighted nodes
- number of internal nodes
- parallel processing
- r-ary tree
- switching circuit theory
- weight of the root of the tree
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics