介数中心性和平均最短路径长度整合近似算法

摘要

基于Brandes算法给出了复杂网络中介数中心性和平均最短路径长度的整合近似算法,通过理论分析和Rocketfuel项目实测数据的实验分析,验证了该整合算法能够快速有效地估计出复杂网络的介数中心性和平均最短路径长度,为进一步的研究工作奠定了基础.%An integrated approximation algorithm for the betweenness centrality and average shortest-path length in complex networks is given in this paper. By academic and experimental analysis, the algorithm has a good performance, which will give help to the further studies.