助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   约束最小割集 的翻译结果: 查询用时:0.176秒
图标索引 在分类学科中查询
所有学科
电力工业
无线电电子学
更多类别查询

图标索引 历史查询
 

约束最小割集
相关语句
  constrained minimum cutset
     AN EFFICIENT ALGORITHM FOR FINDING A CONSTRAINED MINIMUM CUTSET OF A GRAPH AND ITS APPLICATIONS
     求图的约束最小割集的一个有效算法及其应用
短句来源
     An efficient algorithm for finding a constrained minimum cutset of a graph is presented. The algorithm cuts the graph G(V, E) and guarantees a given number of nodes |V1| and |V2| of the two subgraphs G1(V1,.E1) and G2(V2,E2).
     本文提出确定把无向连通图G(V,E)切割为两个子图G_1(V_1,E_1)和G_2(V_2,E_2)且满足顶点集V_1和V_2的顶点数|V_1|和|V_2|为给定值的约束最小割集的一种有效算法。
短句来源
  相似匹配句对
     Constraint least square algorithm
     约束二乘法
短句来源
     The Minimum Weight Spanning Tree with Constraints
     约束支撑树问题
短句来源
     AN EFFICIENT ALGORITHM FOR FINDING A CONSTRAINED MINIMUM CUTSET OF A GRAPH AND ITS APPLICATIONS
     求图的约束割集的一个有效算法及其应用
短句来源
     Constrained Least Square Bidirectional Associative Memory
     约束平方双向联想存贮器
短句来源
     The effects of N,P,K on flower quality are different;
     P肥.
短句来源
查询“约束最小割集”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


An efficient algorithm for finding a constrained minimum cutset of a graph is presented. The algorithm cuts the graph G(V, E) and guarantees a given number of nodes |V1| and |V2| of the two subgraphs G1(V1,.E1) and G2(V2,E2). The development and theory involved in this algorithm is unsophisticated. However it always yields an optimal solution in polynomial time (O|V|2) and it has significant applications in CAA and CAD of networks. In addition, examples to illustrate the steps of this algorithm and its applications...

An efficient algorithm for finding a constrained minimum cutset of a graph is presented. The algorithm cuts the graph G(V, E) and guarantees a given number of nodes |V1| and |V2| of the two subgraphs G1(V1,.E1) and G2(V2,E2). The development and theory involved in this algorithm is unsophisticated. However it always yields an optimal solution in polynomial time (O|V|2) and it has significant applications in CAA and CAD of networks. In addition, examples to illustrate the steps of this algorithm and its applications are given.

本文提出确定把无向连通图G(V,E)切割为两个子图G_1(V_1,E_1)和G_2(V_2,E_2)且满足顶点集V_1和V_2的顶点数|V_1|和|V_2|为给定值的约束最小割集的一种有效算法。该算法理论比较简单,步骤简捷有效,并能保证在多项式时间内获得最优解;此外,本文举例说明该算法具体步骤过程并介绍该算法在计算机辅助电路分析和设计中的某些实际应用。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关约束最小割集的内容
在知识搜索中查有关约束最小割集的内容
在数字搜索中查有关约束最小割集的内容
在概念知识元中查有关约束最小割集的内容
在学术趋势中查有关约束最小割集的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社