1) minimum cut
最小截
1.
The minimum cut problem and maximum flow problem with both node and edge capacities in general networks can be easily reduced to the problem with only edge capacities.
在一般网络中,节点和边都有容量的最小截、最大流问题很容易转化为仅边有容量的问题。
2.
The minimum cut problem between two distinguished nodes in a undirected planar network with limited capacities on both nodes and edges is discussed.
讨论了节点和边都有容量限制的无向平面网络中的两点间的最小截问题。
2) minimum cut set
最小截
1.
Based on equivalent relations between minimum cut sets, new circuit cut can be found.
提出了一个超大规模集成电路分割算法 ,从流图中最小截之间的等价关系出发 ,寻找新的电路割集 。
2.
For convenience to build decision support system relative to the problem of maximum flow & minimum cut set of network with lower & upper arc capacities,a numerical algorithm for finding maximum flow & minimum cut set in network with lower & upper arc capacities,is proposed in this paper.
为了便于建立与有上下界网络最大流与最小截问题有关的决策支持系统,本文给出一个求有上下界网络最大流与最小截的数值算法,证明了算法的理论依据,并举例说明了算法在堵塞流理论中的应用。
3.
The algorithm, which can find the maximum flow and the minimum cut set in the transportation network, has the merits to be programme.
该算法能求出网络最大流和最小截,并具有易于编程实现、收敛性好等优点,大量数值实验表明该算法非常实用有效。
3) min cut set
最小截集
1.
The capacity of the min cut set decides the maximum flow of network.
一个网络的最大流量 ,是由该网络最小截集的截量决定的 。
4) minimum truncation
最小截断
5) minimal cut
最小割截
6) least cross section difference
最小截面差
1.
The method, which is derived from the least cross section difference of the physical quantity, has shown to produce a reliable result in the presence of error sources, such as noise, phase discontinuity more than π and insufficient sampling, etc.
根据被测物理量的整体连续性 ,提出了一种基于最小截面差的相位展开方法。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条