助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   associated graph 的翻译结果: 查询用时:0.009秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

associated graph
相关语句
  伴随图
     WT5BZ]Let A be a n×n symmetric Boolean matix,G(A)be its associated graph,and C 2(A) be the 2 th Combinatorial compound of A. In this paper,following results have been given:If G(A) is bipartite graph,then C 2(A)is reducible.
     设A是n阶对称布尔矩阵 ,G(A)是它的伴随图 ,C2 (A)是A的二级组合合成 ,本文证明了 :若G(A)为二分图 ,则C2 (A)可约 ;
短句来源
     The concepts of associated graph G and associated hypergraph H are introduced for a switching function F(x1,……,xn) with n variables. Then, the following methods and algorithms are derived: (1) The graph theory methods and branch-and-bound algorithm BBAPI for finding all prime implicants of F, (2) Algorithm AMSHT for finding a minimal sum for F by hypergraph theory.
     本文引入了n变量开关函数F(x_1,…,x_n)的伴随图G和伴随超图H的概念,导出了下列方法和算法:(1)求F的所有本原蕴含项的图论方法和分支定界算法BBAPI; (2)应用超图理论求F的最小和表达式的算法AMSHT。
短句来源
  “associated graph”译为未确定词的双语例句
     The aim of this paper is to characterize the eigenvectors by means of the associated graph of the matrix and to give the bounds for the set of all eigenvectors.
     本文的主工目的是通过矩阵的伴随有向图来刻画矩阵的特征向量并给出矩阵特征向量的界。
短句来源
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     n-Graph-semigroup
     n-图半群
短句来源
     sequences and associated r.
     序列及相伴r.
短句来源
     A rank-1 modification for Laplacian matrix associated with a graph is also given.
     文中给出了一种对图的Laplacian矩阵进行平移预处理的方法,以加速Lanczos过程中,次小特征值近似值的收敛。
短句来源
     Applications of Active-correlated Graph Associated with Relationship Graph in the Arrangement of Well Site Equipments
     活动相关图结合关系图法在井场设备布置中的应用
短句来源
查询“associated graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  associated graph
An associated graph representation is introduced that permits easy classification of each algorithm in terms of certain stability aspects.
      
In the past, this framework has been used to solve scheduling problems where the associated graph is naturally acyclic and has done so very efficiently.
      
For this we use the associated graph Γ and assume that there exists a circuit Δ admitting an edge-transitive subgroup of G such that any two edges of Γ lie on some conjugate of Δ.
      
An efficient parallel implementation of adaptive PDE methods then requires distributing the nodes of the associated graph uniformly across the processors so that the resulting cost of communication between processors is low.
      
'Sites' and 'connections' can be translated into terms of graph theory as 'vertices' and 'edges', which enables to consider complexity as an 'associated graph'.
      
更多          


The concepts of associated graph G and associated hypergraph H are introduced for a switching function F(x1,……,xn) with n variables. Then, the following methods and algorithms are derived: (1) The graph theory methods and branch-and-bound algorithm BBAPI for finding all prime implicants of F, (2) Algorithm AMSHT for finding a minimal sum for F by hypergraph theory. These methods are simple and intuitive. They are convenient not only for computation by hand but also for realization by a computer....

The concepts of associated graph G and associated hypergraph H are introduced for a switching function F(x1,……,xn) with n variables. Then, the following methods and algorithms are derived: (1) The graph theory methods and branch-and-bound algorithm BBAPI for finding all prime implicants of F, (2) Algorithm AMSHT for finding a minimal sum for F by hypergraph theory. These methods are simple and intuitive. They are convenient not only for computation by hand but also for realization by a computer. Their computation efficency are higher than that of Karnaugh map method and Q-M tabular method which are customarily used.

本文引入了n变量开关函数F(x_1,…,x_n)的伴随图G和伴随超图H的概念,导出了下列方法和算法:(1)求F的所有本原蕴含项的图论方法和分支定界算法BBAPI;(2)应用超图理论求F的最小和表达式的算法AMSHT。这些方法简单、直观;既便于手算,也便于用计算机实现;计算效率高于常用的卡诺图法和Q-M列表法。

For planar transportation networks, the structure properties of minimum cuts are discussed. Through constructing an associate graph, the problem finding all the minimum cuts in a network is transformed into finding all the shortest paths in the associate graph .

对于一类可平面的运输网络,通过揭示最小割的结构性质,构造辅助图,将求网络的最小割问题转化为在辅助图上求最短路径问题,从而建立了求网络所有最小割的算法。

WT5BZ]Let A be a n×n symmetric Boolean matix,G(A)be its associated graph,and C 2(A) be the 2 th Combinatorial compound of A.In this paper,following results have been given:If G(A) is bipartite graph,then C 2(A)is reducible.If G(A)is 2-connected graph containing odd cycle,then C 2(A) is irreducible and primitive,and primitive exponent γ(C 2(A))≤n 2-2n-1.

设A是n阶对称布尔矩阵 ,G(A)是它的伴随图 ,C2 (A)是A的二级组合合成 ,本文证明了 :若G(A)为二分图 ,则C2 (A)可约 ;若G(A)是含奇圈的 2 连通图 ,则C2 (A)是不可约和本原的 ,它的本原指数γ(C2 (A) )≤n2 - 2n - 1。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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