1) Disjoint trees
不交化树
2) disjoint
[英][dis'dʒɔint] [美][dɪs'dʒɔɪnt]
不交化
1.
In this paper,based on cubical form of Boolean function and disjoint algebra,an algorithm is presented for disjoint of Boolean function,several relative laws for cubes operation are defined,and cubical matrix disjoint algorithm is given with a numerical example.
布尔函数的不交化是进行系统可靠度计算中的重要步骤。
2.
Constructing disjoint minimal pathset is an important approach for reliability analysis of power network.
计算电气主接线相关的可靠性指标时需要不交化最小路,本文利用容斥定理的特点,直接对最小路进行不交化,进而计算出船舶电力主接线的可靠性指标。
3) edge_disjoint spanning tree
边不交的生成树
1.
It makes use of Reduction techniques on the problem of the edge_number of Maximam SES,and the result follows: if a graph G is supereulerian,which has a subgraph H with at most one edge short of three edge_disjoint spanning trees,then the graph G satisfies the Catlin_conjecture when G/H does.
利用收缩的方法研究了超欧拉图的欧拉生成子图的边数问题,得到了结果:若 1个超欧拉图的子图H最多差 1条边有 3棵边不交的生成树,如果把H收缩后的图满足Catlin猜想,则原图也满足Catlin猜想 。
4) He makes no friend who never makes a foe .
不树敌，难交友。
5) edge-disjoint spanning trees
边不交生成树
6) former non-intersect
早期不交化
1.
It is efficient method to get mininal cut sets for fault tree analysis by former non-intersect currently.
利用早期不交化法求解最小割集是目前进行故障树定性分析的一种有效方法。
补充资料：公理化方法(见公理化和形式化)
公理化方法(见公理化和形式化)
axiomatical method
gongllbuafangfa公理化方法化和形式化。(axiomatieal method)见公理
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条