有向网络中具有一个枢纽点的最小支撑树的计算方法  

An ALGORITHM OF THE MINIMUM SPANNING TREE WITH A PIVOTAL POINT IN THE DIRECTED NETWORK

作　　者：翟晓燕[1] 张新政[2] 

机构地区：[1]广东外语外贸大学,广州510420 [2]广东工业大学,广州510090

出　　处：《系统科学与数学》2005年第6期649-657,共9页Journal of Systems Science and Mathematical Sciences

基　　金：国家自然科学基金(60274030)国际合作项目(2003C50302)广州市高校科技计划项目(2056)资助课题.

摘　　要：对有向网络中具有一个枢纽点的支撑树的问题和性质进行了研究,给出了在有向网络图中寻找以某一定点为枢纽点的最小支撑树的计算方法,并对算法的复杂性进行了讨论,最后将该算法应用于实际算例的计算．The problem of the spanning tree with a pivotal point in a directed network and its propeties are considered in the paper, an algorithm for finding the minimum spanning tree with a pivotal point in a directed network is presented, and the complexity of the algorithm is discussed. Finally, an example for applying this algorithm is given.

关 键 词：有向网络 枢纽树 最小枢纽树 

分 类 号：O221.7[理学—运筹学与控制论]