本文研究图g的子图空间g上的三类概率测度，它们分别刻画图的随机扩张树，随机扩张森林和随机连通子图。
We consider three types of probability measures on Q, the set of subgraphs of g, which govern a random spanning tree, a random spanning forest, and a random connected subgraph respectively.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
应用推荐