Two gate variable reduction principles, algorithms of computing K-trees and minimum K-cuts of a network are proposed firstly.

首先提出了网络门限变量的两个化简原则及计算网络K-树和极小K-割的算法。

youdao

And then using Boolean equations containing gate variables and means of OBDD, an efficient algorithm for computing the K-terminal reliability of a network is also proposed.

然后，基于具有门限变量的布尔方程和有序二分决策图方法(OBDD)，给出计算k -终端网络可靠度算法。

youdao

And then using Boolean equations containing gate variables and means of OBDD, an efficient algorithm for computing the K-terminal reliability of a network is also proposed.

然后，基于具有门限变量的布尔方程和有序二分决策图方法(OBDD)，给出计算k -终端网络可靠度算法。

youdao