Combinatorial Merging
- 1 November 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (11) , 1164-1167
- https://doi.org/10.1109/tc.1976.1674574
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.Keywords
This publication has 2 references indexed in Scilit:
- On the minimum stage realization of switching functions using logic gates with limited fan-inPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1964
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952