一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
将最小割集和最小径集的概念引入了因果图理论，并用于重大安全事故的定性和定量分析中。
Qualitative analysis and quantitative analysis are made by using of fault tree analysis, minimum cut sets and importance are calculated.
应用推荐