 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   graph theory problem 的翻译结果: 查询用时：0.155秒 在分类学科中查询 所有学科 更多类别查询 历史查询  graph theory problem 图论问题(2)  图论问题
 Euler solved this problem in 1736.He changed this problem into the first graph theory problem by abstract analyzed method. 欧拉在1736年解决了这个问题,他用抽象分析法将这个问题化为第一个图论问题。 短句来源 Our method in this paper is to transform the SHB problem into the graph theory problem,which is concrete and clear. 该文将SHB问题转化为具体的图论问题。 短句来源 相似匹配句对
 Graph Theory. Graph Theory。 短句来源 On teaching graph theory 关于图论课教学的思考 短句来源 Probability Problem by Graph Theory 用图论的方法解决概率问题 短句来源 [s,t]-GRAPH [s,t]-图及其Hamilton性 短句来源 Probability Problems by Graph Theory 用图论的方法解决概率问题 短句来源 查询“graph theory problem”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  graph theory problem
 By translating the multicast scheduling problem into a graph theory problem and employing a random graph approach, we are able to obtain a probabilistic upper bound on the performance of the multicast scheduling algorithm. We have solved the graph theory problem of updating the geodesic distances and the numerical problem of updating the co-ordinates. We have used the queuing system to solve a common graph theory problem, finding the Minimum Crossing Number of a complete graph. He used fragments of DNA to compute the solution to a complex graph theory problem. A graph G is edge reconstructible if every edge reconstruction of graph G is isomorphic to graph G. The edge reconstruction conjecture of graphs means that all finite undirected simple graphs on at least four edges are edge reconstructible, one of the well known graph theory problems which remain to be solved so far. This paper mainly studies the edge reconstruction problems of graphs by using the method of defining special functions and presents two simple formal... A graph G is edge reconstructible if every edge reconstruction of graph G is isomorphic to graph G. The edge reconstruction conjecture of graphs means that all finite undirected simple graphs on at least four edges are edge reconstructible, one of the well known graph theory problems which remain to be solved so far. This paper mainly studies the edge reconstruction problems of graphs by using the method of defining special functions and presents two simple formal sufficient conditions only with the maximum degree and minimum degree of graphs as parameters. 如果图 G的每个边重构图都与图G同构 ,则称图G是边可重构的 .图的边重构猜想是指所有的至少有 4条边的有限无向简单图都是边可重构的 ,它是至今尚未解决的著名的图论问题之一 .文章主要通过定义特殊函数的方法来研究图的边重构性问题 ,并给出仅以图的最大顶点次数和最小顶点次数作为参数的简单充分条件 . This work grews out of a computational problem that arises in a technology called DNA sequencing by hybrdization(SBH).In sequencing,by hybridization,one attempts to lean the entire sequence of a long DNA string S by first determining which k-length substrings occur in S.Through investigating the overlap patterns of the k-length substrings,one can reconstruct the original string.Our method in this paper is to transform the SHB problem into the graph theory problem,which is concrete and clear.With the... This work grews out of a computational problem that arises in a technology called DNA sequencing by hybrdization(SBH).In sequencing,by hybridization,one attempts to lean the entire sequence of a long DNA string S by first determining which k-length substrings occur in S.Through investigating the overlap patterns of the k-length substrings,one can reconstruct the original string.Our method in this paper is to transform the SHB problem into the graph theory problem,which is concrete and clear.With the relationship between graph and its line-graph,writers exploit the mathematical model of transversal theory for SHB.They set up the algorithm to obtain the optimal solution for the Hamiltonian path(or tour ),which is for the case that every node's out-degree and in-degree no less than2,it is also the equivalent form for the BSH problem.The paper analyzes the complexity for the algorithm,at the end it gives problem for further explorting. 该文源于DNA序列杂交先后顺序的工程计算问题。在杂交先后顺序(SHB)问题中,人们试图想通过首先确定在一个很长的DNA字符串S中出现的k-长子串来了解整个原始的字符串S,通过研究k-长子串的重叠模式来重新构造原始的字符串S。该文将SHB问题转化为具体的图论问题。根据图及其线图的关系,部分解决了上述SHB问题的等价形式,即在有向线图顶点的入度和出度不超过2的情形下,用遍历理论为SHB问题建立了数学模型,从而能在多项式时间内找到有向线图的哈密顿路或圈。文章最后,指出了须进一步研究的问题。 Pure Parsimony Haplotype Inference (PPHI) Problem is one of the haplotyping problems:Given an input set of n genotype vectors,find a set of n pairs of haplotypes,one for each genotype vector,such that the number of distinct haplotypes is minimum.An u-Restricted Pure Parsimony Haplotype Inference (u-PPHI) Problem is a special PPHI problem such that every haplotype can be used to resolve at most u genotypes.Both PPHI problem and u-PPHI problem are NP-hard.In this paper,a mating... Pure Parsimony Haplotype Inference (PPHI) Problem is one of the haplotyping problems:Given an input set of n genotype vectors,find a set of n pairs of haplotypes,one for each genotype vector,such that the number of distinct haplotypes is minimum.An u-Restricted Pure Parsimony Haplotype Inference (u-PPHI) Problem is a special PPHI problem such that every haplotype can be used to resolve at most u genotypes.Both PPHI problem and u-PPHI problem are NP-hard.In this paper,a mating graph is introduced and both problems are turned into graph theory problems.Two approximate algorithms are proposed,one for the PPHI problem and the other for the u-PPHI problem.Especially,the 2-PPHI problem is investigated and an algorithm for solving the 2-PPHI problem on the mateing graph is given. 纯节俭型单体型推断(PPHI)问题是这样一类单体型推断问题给定n个基因型向量,要求寻找n对单体型,使得每一个基因型刚好由其中一对单体型组合生成,并且这2n个单体型中所含的不同单体型数目最小.u-限制单体型推断(u-PPHI)问题是一类特殊的纯节俭型单体型推断问题,要求每一个单体型至多可以用于分解u个基因型.PPHI和u-PPHI问题都是NP-困难的.文中首先介绍了配对图的概念,并通过配对图将两类问题转化为图论问题;然后分别给出了两类问题的近似算法;最后,专门讨论了当u=2时的2-PPHI问题,并在配对图上给出了相应的算法. 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社