Issue No. 11 - November (1976 vol. 25)
M.C. Golumbic , Department of Computer Science, New York University
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.
Fan-in, integer weighted nodes, number of internal nodes, parallel processing, r-ary tree, switching circuit theory, weight of the root of the tree.
M. Golumbic, "Combinatorial Merging," in IEEE Transactions on Computers, vol. 25, no. , pp. 1164-1167, 1976.