摘要
用顶点和边都加权的赋权图来表示通信网络,其中顶点表示网络的通信站,边表示网络的通信线路,顶点或边上的权指的是破坏其所对应的通信站或通信线路需要付出的代价。提出了赋权连通度、赋权边连通度和赋权混合连通度的概念,这些参数是图的连通度、边连通度和连通度对的概念的推广。它们比连通度和边连通度等图的参数能更精确地反映通信系统的抗破坏能力。利用求网络最大流和最小割的 Ford-Fulkerson标号法,给出了求赋权连通度、赋权边连通度和赋权混合连通度的有效算法。
Abstract: Connectivity, edge connectivity and connectivity pair are the concepts often used to indicate the survivability of communication networks. These parameters indicate the minimum number of communication stations or communication lines that need to be destroyed to put the system out of use. Since the amount of work to destroy a communication station or a communication line is not always the same, instead of unweighted graphs, we use weighted graphs to represent communication networks in this paper, where the weight of a vertex or an edge is the amount of work needed to destroy the correspondingstation or line. Three new concepts-weighted connectivity, weighted edge connectivity and weightedmixed connectivity-are proposed. It is shown that these parameters are generalizations of connectivity.edge connectivity and connectivity pair, and they are more precise in indicating the survivability of communication networks. Efficient algorithms for computing these new parameters are proposed on the basis of Ford-Fulkerson's Labeling Method.
出处
《西北工业大学学报》
EI
CAS
CSCD
北大核心
2002年第1期100-103,共4页
Journal of Northwestern Polytechnical University
基金
国家自然科学基金(10101021)资助
关键词
赋权图
赋权连通度
赋权边连通度
赋权混合连通度
标号法
通信系统
抗破坏能力
Key words: weighted graph, weighted connectivity, weighted edge connectivity, weighted mixedconnectivity, Ford-Fulkerson's Labeling Method