论文部分内容阅读
提出了流约束通讯网络的一个快速有效算法 .系统是可靠的当且仅当特殊指定的流能从源点传递到汇点 ,文中算法与传统算法有所区别 ,将传统的两阶段算法转化为一阶段算法 .算法Ⅰ以任何一个有效组为初始有效组 ,所有的有效组都可以从此初始有效组中生成 ,且由此生成的所有有效组彼此不交 ,算法Ⅱ是第一个算法的对偶算法 ,同时文中给出一个反例表明 [8]中算法会遗漏有效组
A fast and efficient algorithm for flow-constrained communication networks is proposed.The system is reliable if and only if a specified flow can be delivered from a source to a sink, the proposed algorithm differs from traditional algorithms by converting the traditional two-phase algorithm to One-stage algorithm: Algorithm I uses any valid group as the initial valid group, and all valid groups can be generated from this initial valid group, and all the valid groups generated therefrom do not intersect with each other. The algorithm II is the dual of the first one Algorithm, at the same time, a counterexample is given to show that the algorithm omits the valid group [8]