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

图标索引 历史查询
 

graph problems
相关语句
  图论问题
     Lower Bounds of Some Graph Problems under the Fixed BT Model
     几个图论问题在固定BT模型下的指数下界
     Two Graph Problems and Their Solutions in Testability
     可测试性技术中的图论问题及其求解
短句来源
  “graph problems”译为未确定词的双语例句
     To Solve Drawing Geometric Graph Problems With Oblique Projection
     用斜投影解决画法几何图解问题
短句来源
     The parallel algorithms for some basic graph problems are given on the SIMD PRAM computation models with limited number of processors.
     在限定处理机个数的 CREW PRAM并行计算模型上,给出了图论中一些基本问题的并行算法.
短句来源
     This paper discusses some special cases of NP-complete graph problems in which the given graph is a tree By means of the pre-order labeling presentation of a tree, we present several linear time algorithms for graph problems on trees These algorithms are all asymptotically optimal
     讨论了图算法中若干NP完全问题在所给的图是一棵树时的特殊情形- 利用树结构的前序编号表示法提出了解树的最大独立集问题、最小顶点覆盖问题和最小支配集问题的线性时间算法-在渐近意义下这些算法都是最优算法
短句来源
  相似匹配句对
     On the Graph Labeling Problems
     关于图标号问题
短句来源
     Problems
     问题
短句来源
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     On Some Problems of Fuzzy Graph
     关于乏晰图的若干问题
短句来源
     On D-Cydes in Graph
     关于图中的D—圈
短句来源
查询“graph problems”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  graph problems
We show that such an array can be used to solve some scheduling and graph problems efficiently.
      
Systolic algorithms for some scheduling and graph problems
      
Using these schemes, we develop optimal or near optimal algorithms for fundamental graph problems.
      
Second, for recursively constructed graphs in general, we construct a predicate calculus within which graph problems can be stated and for those so stated, a linear time algorithm exists and can be automatically generated.
      
Enumeration of spanning trees of an undirected graph is one of the graph problems that has received much attention in the literature.
      
更多          


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...

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)图问题。本文概述了这方面的一些成果并提出一类四次正则图(圈五——树形图)的构造方法并讨论了它的直经。

In this paper,we present some parallel algorithms for graph problem on the treemesh structure with n×n leaf-nodes,including a n-order matrix multiplication algorithm in timeO(nlogn),an algorithm of finding all-pairs shortest-path of n-vertex digraph in time O(nlogn),anda bridge-finding algorithm of n-vertex undirected graph in time O(log~3n).

本文在分析树网结构的同时,发现了树网上一特殊的传播规律。利用此规律我们给出了在n 阶树网(n×n 个叶结点)上O(nlogn)步的n 阶矩阵乘法算法,此算法具有广泛的应用。运用它可有效地模拟二维网孔模型上一类算法。最后,我们给出了在n 阶树网上求n 个顶点无向图的快速桥算法,其时间复杂性为O(log~3n)。

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个顶点图实施并行算法所用处理机的个数和最坏情况下的时间复杂性。

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

 


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

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