首先提出了网络门限变量的两个化简原则及计算网络K-树和极小K-割的算法。
Two gate variable reduction principles, algorithms of computing K-trees and minimum K-cuts of a network are proposed firstly.
煤基质的孔隙性对流体流动影响极小，试井所得渗透率反映的是割理系统的渗流能力。
The matrix pores in coal play a little role in fluid flow, therefore the permeability derived from well test is the reflection of the percolation flow capacity in cleat system.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
应用推荐