DocumentCode
1131973
Title
Combinatorial Merging
Author
Golumbic, Martin C.
Author_Institution
Department of Computer Science, New York University
Issue
11
fYear
1976
Firstpage
1164
Lastpage
1167
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
Fan-in, integer weighted nodes, number of internal nodes, parallel processing, r-ary tree, switching circuit theory, weight of the root of the tree.; Feedback; Hazards; Merging; Performance analysis; Phase detection; Sequential circuits; Signal analysis; Signal detection; Signal processing; Testing; Fan-in, integer weighted nodes, number of internal nodes, parallel processing, r-ary tree, switching circuit theory, weight of the root of the tree.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1976.1674574
Filename
1674574
Link To Document