1) vertex-disjoint
内点不交
1.
This paper shows that there are m_1+m_2+…+m_n-n vertex-disjoint routes between any two nodesxandy,with length less than or equal to H(x,y)+2 in n-dimension Generalized Hypercube networks Q(m_1,m_2,…,m_n) in which there exists H(x,y) routes betweenxandywith length equal to H(x,y).
证明了n-维广义超立方体网络Q(m1,m2,…,mn)中,任意两个节点x和y之间存在长度均不超过H(x,y)+2的m1+m2+…+mn-n条内点不交的路由,其中有H(x,y)条长度不超过H(x,y),此处H(x,y)表示x到y的汉明距离。
2) Vertex-disjoint path
点内部不交路
3) Internally node-disjoint paths
内结点不交叉路径
4) inner-cross point
内交点
5) vertex-disjoint cycles
点不交圈
6) infeasible-interior-point
不可行内点
1.
An infeasible-interior-point algorithm for reactive power optimization problem in power system;
基于一种不可行内点法的电力系统无功优化
补充资料：点交
1.点数交付。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条