This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Combinatorial Merging
November 1976 (vol. 25 no. 11)
pp. 1164-1167
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.
Index Terms:
Fan-in, integer weighted nodes, number of internal nodes, parallel processing, r-ary tree, switching circuit theory, weight of the root of the tree.
Citation:
M.C. Golumbic, "Combinatorial Merging," IEEE Transactions on Computers, vol. 25, no. 11, pp. 1164-1167, Nov. 1976, doi:10.1109/TC.1976.1674574
Usage of this product signifies your acceptance of the Terms of Use.