1) Minimum points set
最小点集
2) minimum break point set
最小断点集
1.
In order to decrease the complexity of determining the minimum break point set in a large scale complicated multi-loop power networks,the whole network can be partitioned into several sub-networks in advance.
对大规模复杂环网预先进行网络分割是降低最小断点集问题计算复杂性的有效途径。
2.
Based on the directed graph of primary relay and backup relay s coordination relationships,a new method to determine the minimum break point set(MBPS)by graph simplification is proposed in this paper.
基于保护主后备配合依赖关系有向图,提出了通过有向图化简计算保护配合最小断点集(MBPS)的新方法。
3.
The key procedures to determine optimal coordination sequence of directional protection for multi-loop power network is to solve the minimum break point set (MBPS).
确定复杂环网方向保护最优配合顺序的核心步骤是求解最小断点集(minimum break point set,MBPS)。
3) minimum vertex cover
最小顶点覆盖集
1.
An approximate algorithm for minimum vertex cover set of a graph;
求图的最小顶点覆盖集的一个近似算法
4) minimum break point set (MBPS)
最小断点集(MBPS)
5) minimum feedback vertex set
最小反馈顶点集
6) maximizing and minimizing sets
最大最小集
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条