全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 graph isomorphism test 的翻译结果: 查询用时：0.027秒
 在分类学科中查询 所有学科 更多类别查询

 历史查询

 graph isomorphism test 图同构(1)
 图同构
 A Supplement of the Complexity of Graph Isomorphism Test 关于图同构复杂性的一点补充 短句来源
 相似匹配句对
 Application of Isomorphism of Graph 图同构性的应用 短句来源 [s,t]-GRAPH [s,t]-图及其Hamilton性 短句来源 THE PROPERTIES OF Adam ISOMORPHISM OF THE CIRCULANT GRAPH 循环图的Adam同构的性质 短句来源 A Supplement of the Complexity of Graph Isomorphism Test 关于图同构复杂性的一点补充 短句来源 n-Graph-semigroup n-图半群 短句来源

我想查看译文中含有：的双语例句
 没有找到相关例句
 The theory of a heuristic algorithm for graph isomorphism testing has been discussed in this paper. With a specific circuit, a novel and practical network comparison algorithm for layout verification of analog ICs was proposed and simulated on an IBM PC/XT, and an excellent result has been obtained. 本文全面讨论了同构检测的启发式算法的理论基础,结合具体电路,提出了一个全新的、实用的电网络同构检测方法,并在IBM PC/XT机上进行了模拟,结果良好。 The vertex with maximum degree and its incidence edges in the graph G are deleted The remaning subgraphs follow in the same way until the last subgraph empty If degrees of the deleted vertexes x\-1,x\-2,…,x\-l are P\-1,P\-2,…,P\-l in order The series P\-1,P\-2,…,P\-l is called the degree series of the graph G The set consists of the degrees of other ends of the incidance edges of x\-i(1≤i≤l) in graph G,is called the incidence degree set of x\-i The complexity of graph isomorphism test is proved... The vertex with maximum degree and its incidence edges in the graph G are deleted The remaning subgraphs follow in the same way until the last subgraph empty If degrees of the deleted vertexes x\-1,x\-2,…,x\-l are P\-1,P\-2,…,P\-l in order The series P\-1,P\-2,…,P\-l is called the degree series of the graph G The set consists of the degrees of other ends of the incidance edges of x\-i(1≤i≤l) in graph G,is called the incidence degree set of x\-i The complexity of graph isomorphism test is proved to be polynomial by calculating and comparing the degree series,the degrees of the deleted vertexes and their incidence degree set 在图 G =(V,E)中 ,删除其度数最大的顶点及其关联的边 ,在余下的子图中 ,如法炮制 ,直至余下的子图为零图 .设所删除的这些顶点 x1 ,x2 ,… ,xi 的度数依次为 P1 ,P2 ,… ,Pl,称序列 P1 ,P2 ,… ,Pl 为图 G的度序列 ;xi(1≤ i≤ l)关联的边的另一端点在 G中的度数的集合称为顶点 xi 关联的度集合 .通过计算、比较两图的度序列、被删除的顶点的度数以及它们关联的度集合 ,证明两图同构问题的复杂度是多项式的
 相关查询

 CNKI小工具 在英文学术搜索中查有关graph isomorphism test的内容 在知识搜索中查有关graph isomorphism test的内容 在数字搜索中查有关graph isomorphism test的内容 在概念知识元中查有关graph isomorphism test的内容 在学术趋势中查有关graph isomorphism test的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社