r元树的最优树  

The Method for Choosing the Best r-Multiple Trees

作　　者：张玲萍[1] 

机构地区：[1]淮阴师范学院数学系,江苏淮安223300

出　　处：《湖州师范学院学报》2007年第2期19-21,共3页Journal of Huzhou University

摘　　要：为了找出任意给定的t片带权树叶的r元最优树,通过对顶点、树高、树叶、分支点和权数的关系的讨论,确定出最优树树高的范围.通过此法能找出满足条件的所有最优树,并简化了树的权数的计算.In this paper, we derive the method of how to fined out the best r - multiple tree by the given pieces of leaves. Through examining the relations between the tops, heights, leaves, branched nodes and WPL, we can find out all the best trees and simplify the calculation of WPL.

关 键 词：最优树 顶点 树高 树叶 分支点 权数 

分 类 号：O157.6[理学—数学]