助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   graph problem 在 数学 分类中 的翻译结果: 查询用时:0.061秒
图标索引 在分类学科中查询
所有学科
数学
计算机软件及计算机应用
水利水电工程
地球物理学
宏观经济管理与可持续发展
电信技术
更多类别查询

图标索引 历史查询
 

graph problem
相关语句
  图问题
    The supereulerian graph problem is an important study in the circle of graph theory, which mainly includes two aspects: one is the determination of supereulerian graphs and the other is the edge-problem.
    超欧拉图问题是图论研究中非常重要的一个问题,这一问题主要有两方面:一判定问题,二边数问题。
短句来源
    In this paper,the extremal graph problem of the zeroth-order general randi index of trees with diameter not more than 4 is investigated.
    本文研究直径不超过4的树关于零阶广义Randi指数的极图问题
短句来源
  图形问题
    Solving a graph problem in mathematic analysis by MATLAB
    用MATLAB解决数学分析中的图形问题
短句来源
    A Solution to a Kind of Graph Problem
    一类图形问题的求解
短句来源
  图问题
    The supereulerian graph problem is an important study in the circle of graph theory, which mainly includes two aspects: one is the determination of supereulerian graphs and the other is the edge-problem.
    超欧拉图问题是图论研究中非常重要的一个问题,这一问题主要有两方面:一判定问题,二边数问题。
短句来源
    In this paper,the extremal graph problem of the zeroth-order general randi index of trees with diameter not more than 4 is investigated.
    本文研究直径不超过4的树关于零阶广义Randi指数的极图问题
短句来源
查询“graph problem”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  graph problem
In this note we introduce a graph problem, called Maximum Node Clustering (MNC).
      
This maximum split graph problem gives rise to an associated partitioning problem that we call the split-coloring problem.
      
Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem
      
Thus we immediately have an efficient algorithm for this graph problem.
      
Adaptive methods for PDEs can be viewed as a graph problem.
      
更多          


When considering multicomputer systems and multiprocessor systems,regular network of low degree having small maximum message path lengths(or graph diameters)are of interest.The interconnected network can be represented by undi- rected graphs.The vertices represent the processing elements and the edges represent the links to be used to transmit a message.Wishing to minimize the message- passing overhead, the diameter of graph should be as small as possible.In graph theory it is the(△,d)graph problem. In...

When considering multicomputer systems and multiprocessor systems,regular network of low degree having small maximum message path lengths(or graph diameters)are of interest.The interconnected network can be represented by undi- rected graphs.The vertices represent the processing elements and the edges represent the links to be used to transmit a message.Wishing to minimize the message- passing overhead, the diameter of graph should be as small as possible.In graph theory it is the(△,d)graph problem. In this paper we introduce a new family of regular dense graph with order 4 and investigate the diameter of the graph.

近几年来很多作者讨论了多计算机系统中的稠密网络问题以及在图论中与此有关的(△,d)图问题。本文概述了这方面的一些成果并提出一类四次正则图(圈五——树形图)的构造方法并讨论了它的直经。

The parallel algorithms for some basic graph problems are given on the SIMD PRAM computation models with limited number of processors. The parallel cost, c(n)=p(n)*t(n), of these algorithms are the best result known so far. p(n), t(n) represent the num-ber of processors used and the worst case time complexity of a parallel algorithm for a graph with n vertice respectively.

在限定处理机个数的 CREW PRAM并行计算模型上,给出了图论中一些基本问题的并行算法.所给并行算法的费用c(n)=p(n)*t(n)是目前已知的最好结果,其中p(n),t(n)分别是对一具有n个顶点图实施并行算法所用处理机的个数和最坏情况下的时间复杂性。

In this paper, it was discussed that how to solving Euler loop problems by means of genetic programming.The methods of hierachical decomposition, population define and fitness measure were also given in this paper.We analysed and compared the results of the genetic programming.The process of solving the Euler loop problems in this paper may give some help for solving other graph problems.

讨论了用遗传规划寻找任意欧拉图中的欧拉回路的原理,给出了解题的分级方法,群体定义方法与适合值的测试方法,并对结果进行了分析比较。本文所述方法对用遗传规化解其它图论问题也有启发作用

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

 


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

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