2) vertex-disjoint cycles 点不交圈3) disjointing double cyclic graph 不交双圈4) nonrecurring edge cycley 边不重的圈5) edge-disjoint paths 边不交道路 1. This paper proposes the reliability optimization for edge-disjoint paths under m nodes’ malfunction. 研究的问题是无线传感器网络中...
3.In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g. 给定一个无向连通图g,圈包装问题就是求g的边不相交圈的最大数目。 4.If she is indifferent to your actions, that such a narrow-minded ...
Sur l'existence de deux cycles supplémentaires unicolores, disjoints et de couleurs différentes dans un graphe complet bicolore / An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees ...
求翻译:subset disjoint negative cycles是什么意思?待解决 悬赏分:1 - 离问题结束还有 subset disjoint negative cycles问题补充:匿名 2013-05-23 12:21:38 子不相交的负循环 匿名 2013-05-23 12:23:18 子集弄乱消极周期 匿名 2013-05-23 12:24:58 子集弄乱消极周期 匿名 2013-05-23 12:26:3...
It is a heavy computation to perform widest disjoint paths(WDP) algorithm on every path,and the algorithm is very time-consuming——computing a set of n paths will take O(n~3) cycles. 针对最宽不相交路径(WDP)算法计算每个可行路径工作量大而且非常耗时——计算n条路径需要耗费O(n3)次迭代的问...
a昨天我的手表丢了 Yesterday my wristwatch lost[translate] a昨晚没睡好吗 Has not had a good sleep last night[translate] aLet G be a graph in which every pair of cycles are edge-disjoint and A=(a 正在翻译,请等待...[translate]
3) edge-disjoint cycles 边不交圈4) 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) ...
3.In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edgedisjointcycles in g. 给定一个无向连通图g,圈包装问题就是求g的边不相交圈的最大数目。 4.If she is indifferent to your actions, that such a narrow-minded friend...
1. We show that if the minimum degree of G is at least 2k-1,then G contains at least k-1 disjoint 6-cycles. 若G的最小度至少为2k-1,则G至少包含k-1个独立6-圈。更多例句>> 2) disjoint directed 6-cycles 独立有向6-圈 1. We show that if the minimum degree of D is at least...