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

图标索引 历史查询
 

graph problem
相关语句
  图问题
     Algorithm of the Time-constrained Multistage Graph 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指数的极图问题
短句来源
     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.
     超欧拉图问题是图论研究中非常重要的一个问题,这一问题主要有两方面:一判定问题,二边数问题。
短句来源
     This is to say, according to the flowing situation of water flow, this paper sums up its features and simitrdes compared with multistage graph problem, then defines a special water and gives another algorithm.
     也即是根据水流在水槽中的流动情况,归纳出其特点,将其与多段图的特点进行对比分析,得出相同点,然后利用其性质定义了一种特定性质的水流,提出了多段图问题的另一种解法。
短句来源
     Another Solution to Multistage Graph Problem Based on Water Channel Principium
     基于水槽原理的多段图问题的另一种解法
短句来源
更多       
  图形问题
     Solving a graph problem in mathematic analysis by MATLAB
     用MATLAB解决数学分析中的图形问题
短句来源
     Solving Graph Problem in Analytical Geometry by MATLAB
     用MATLAB解决解析几何的图形问题
短句来源
     A Solution to a Kind of Graph Problem
     一类图形问题的求解
短句来源
  “graph problem”译为未确定词的双语例句
     This paper presents efficient algorithms of total length linear layout graph problem of interal weighted outer planar graph, specially, the parallel algorithm of this problem, whose complexity is O( log 2n) on O(δn 2) processors under CREW-PRAM parallel computing model.
     本文对整数赋权的外平面图的总边长线性布局问题给出多项式算法,并且在CREW-PRAM并行计算模型下给出了并行算法,其在O(δn2)台处理机上需时O(log2n)
短句来源
     AN APPROACH TO THE CONSTRAINT NET GRAPH PROBLEM BY BACKWARD - REASONING METHOD
     求解约束网络图的逆向推理方法
短句来源
     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 阶矩阵乘法算法,此算法具有广泛的应用。
短句来源
     In this paper, by expressing the logic function of every node in the circuits as OBDD, it transforms backtracking into solving the graph problem of OBDD, which avoids backtracking and speeds up the test generation.
     文中利用 OBDD来表示电路中每个节点所代表的逻辑函数 ,把传统算法中的反向回溯过程转换为 OBDD图的问题 ,从而加快了故障测试的速度 .
短句来源
     software engineering management is a problem of making decisions in each phase serially, has the character of multistage graph problem in dynamic planning algorithm.
     它是一个多阶段决策问题,具有动态规划算法中多段图的特点。
短句来源
更多       
查询“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)图问题。本文概述了这方面的一些成果并提出一类四次正则图(圈五——树形图)的构造方法并讨论了它的直经。

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 problem的内容
在知识搜索中查有关graph problem的内容
在数字搜索中查有关graph problem的内容
在概念知识元中查有关graph problem的内容
在学术趋势中查有关graph problem的内容
 
 

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