Skip Navigation

IMA Journal of Mathematical Control and Information 1984 1(4):397-405; doi:10.1093/imamci/1.4.397
© 1984 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by SURAWEERA, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Minimum-Entropy Tree Structures with a Given Terminal Node Assignment

FRANCIS SURAWEERA

Department of Mathematics, Kuwait University P.O. Box 5969, Kuwait

In this paper we characterize a class of rooted trees having a given number of terminal vertices in each level of the tree and a given height. We also present two conditions for the existence of a graphical representation of the above class of trees. Then we consider an entropy function which is defined on the paths in the trees and give an algorithm to construct minimum-path-entropy tree structures.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.