树的m—路中心  

THE M-PATH CENTERS IN TREES

作　　者：刘松[1] 蔡延光[2] 

机构地区：[1]重庆大学 [2]湖北汽车工业学院

出　　处：《重庆大学学报（自然科学版）》1991年第4期104-110,共7页Journal of Chongqing University

摘　　要：提出了m—路中心的概念。对无权树和赋权树分别给出了O(n log n),O(n^2)及O(n log (d(T)/Wminee(T)))算法,其中Wminee(T)是赋权树的最小权数。Let G be a simple graph. If the set of paths F10,P20,… ,Pm0 minimizes dma(x; P1 , P2,…,Pm) = max min min d(x,y) for all sets of m - paths P1 ,P2,… pm of G.then p10,P20, …, Pm ss said the m- path center in G, In this paper, O(n log n),0(n2) and O(n log (d(T)/ Wmtnee(T ) ) algorthms have been presented for finding m-path centers in unweighted and edge - weighted trees respectively , where Wminee(T) is the minimum weight of the edge- weighted tree.

关 键 词：路中心 网络选址 树 算法 

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