网络连通度算法的性能分析与比较  

Performance analysis and comparison of algorithms for measures of network connectivity

作　　者：孙小军[1] 王志强 刘三阳[3] 

机构地区：[1]宝鸡文理学院数学系,陕西宝鸡721013 [2]总装备部驻天水地区军事代表室,陕西宝鸡721006 [3]西安电子科技大学理学院,陕西西安710071

出　　处：《福州大学学报（自然科学版）》2012年第3期299-303,共5页Journal of Fuzhou University(Natural Science Edition)

基　　金：陕西省教育厅科研资助项目(11JK0509);宝鸡文理学院重点科研项目(ZK11131)

摘　　要：从四个方面分析和比较了两种求解网络连通度问题的算法性能.结果表明,在相同的计算环境下,两种算法的计算结果相同,但与基于最大流方法的算法相比,基于影响度向量的算法由于每次迭代只需要计算和存储点影响度向量和网络影响度向量,具有更高的计算效率,需要更小的存储空间,并且易于计算机实现.Two algorithm＇ s performances on the network connection problem pared in this paper from four aspects. It shows that the two analyzed algorithms are analyzed and com- present the same result in the same computing environment. However, compared with the algorithm based on the maximum flow method, the alg6rithm which is based on influence vector is of better computation efficiency and smaller storage room with the reason that it only needs to compute and store the influence vector of point and network in single iteration. Besides, it is easy to proffram and calculate.

关 键 词：网络连通度 最大流方法 影响度向量 算法 

分 类 号：O224[理学—运筹学与控制论]