摘要
连通度是衡量军事网络抗毁性能的一个重要指标。本文首先通过两个定理给出判断军事网络连通性的依据,并针对现有算法在计算连通度时具有较高时间复杂度和空间复杂度的不足,提出了计算军事网络连通度的一种新解法,最后通过具体的军事应用表明了算法的有效性。
Connectivity is an important indication to evaluate the invulnerability of military networks. The basis which is used to judge the connexity of a graph is given by introducing two theories, and according to the high time complication and space complication problem of Maximum Flow Method for computing the connectivity of military networks, a new algorithm is proposed. Finally, an example of military networks application is provided to show the effectiveness of this method.
出处
《长春理工大学学报（自然科学版）》
2008年第3期149-151,共3页
Journal of Changchun University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金项目(70601036)
关键词
军事网络
抗毁性
连通性
连通度
military networks
invulnerablity
connectivity
connexity
