期刊名称：International Journal of Electronics Communication and Computer Engineering
印刷版ISSN：2249-071X
电子版ISSN：2278-4209
出版年度：2015
卷号：6
期号：3
页码：384-390
出版社：IJECCE
摘要：The average distance of a finite graph G=(V,E) is the average of the distances over all unordered pairs of vertices. A minimum average distance spanning tree of G is a spanning tree of G with minimum average distance. Such a tree is sometimes referred to as a minimum routing cost spanning tree. In this paper, we present an efficient algorithm to compute a minimum average distance spanning tree on circular-arc graph in O(n^2)time, where n is the number of vertices of the graph
关键词：Algorithms With Complexity; Circular-Arc Graphs; MAD Tree; Spanning Tree
