流约束通讯网络可靠度的一个新算法

提出了流约束通讯网络的一个快速有效算法，系统是可靠的当且仅当特殊指定的流能从源点传递到汇点，中算法与传统算法有所区别，将传统的两阶段算法转化为一阶段算法，算法Ⅰ以任何一个有效组为初始有效组，所有的有效组都可以从此初始有效组中生成，且由此生成的所有有效组彼此不交，算法Ⅱ是第一个算法的对偶算法，同时中给出一个反例表明8]中算法会遗漏有效组。

A new algorithm for reliability evaluation of telecommunication networks with link-capacities

This paper presents a fast and efficient algorithm for reliability evaluation of telecommunication networks with link-capacities.A system is considered reliable only if it successfully transmits at least the reauired system capacity from the transmitter to the receiver station.The algorithms we give differ from the traditional method and convert the traditional 2-step algorithm into 1-step algorithm.Algorithm Ⅰ starts from any valid group as its initial valid group,and all valid groups are generated from it and disjoint.Algorithm Ⅱ is a doal algorithm of algorithm I.Also we give a counter example to show that the algorithm in 8] can lead to leave out valid group.