中文摘要：

为了解决在网络可靠度计算中存在运算量过大的问题,利用不交和的原理计算网络的可靠性是当今所有计算网络可靠性方法中最有效的方法之一,但对大型网络依然无法快速确定网络可靠度。针对这一问题,采用直接构造不交化通路集的方法,结合网络简化技术和截断误差理论,提出了一种快速确定大型通风网络可靠度的算法。结果表明：本算法可在24 s内计算出传统算法10 h都无法算出的大型通风网络可靠度问题。该算法对提高大型通风网络可靠度计算速度具有很大作用。

英文摘要：

To solve the problem of too many operations in determining network reliability computing network reliability by using disjoint principle is one of the most efficient methods nowadays, but it can not determine the reliability of large-scale networks quickly. Considering this problem, a method of direct constructing disjoint paths is adopted, at the same time network simplification technology and truncation error theory is combined.A new algorithm for determining the reliabilities of large-scale ventilation networks quickly is put forward. It shows that the new algorithm can compute the reliability of a large-scale ventilation network in 24 seconds but the traditional algorithm can not complete in 10 hours. The new algorithm is very useful in computing the reliability of a large-scale ventilation network.