 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   graph problem 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时：0.722秒 在分类学科中查询 所有学科 计算机软件及计算机应用 数学 水利水电工程 地球物理学 宏观经济管理与可持续发展 电信技术 更多类别查询 历史查询  graph problem 图问题(2)图形问题(1)图问题(1)  图问题
 Algorithm of the Time-constrained Multistage Graph Problem 基于带时间约束的多段图问题的回溯算法 短句来源 ：The time-constrained multistage graph problem is one spread out from the multistage graph problem．In this paper the means of expression of recursion set and the backtrace technique are introduced into the path selection in the time-constrained multistage graph，by which the minimum cost for the tourist path is worked out through calculation in a given time． 基于带时间约束的多段图问题是多段图问题的自然扩展。 该文带时间约束的多段图的路径选择，引入了递归集合的表示方法和回溯技术，在给定时间条件下计算出了最小成本的旅游路径。 短句来源 图形问题
 Solving Graph Problem in Analytical Geometry by MATLAB 用MATLAB解决解析几何的图形问题 短句来源 图问题
 Algorithm of the Time-constrained Multistage Graph Problem 基于带时间约束的多段图问题的回溯算法 短句来源 ：The time-constrained multistage graph problem is one spread out from the multistage graph problem．In this paper the means of expression of recursion set and the backtrace technique are introduced into the path selection in the time-constrained multistage graph，by which the minimum cost for the tourist path is worked out through calculation in a given time． 基于带时间约束的多段图问题是多段图问题的自然扩展。 该文带时间约束的多段图的路径选择，引入了递归集合的表示方法和回溯技术，在给定时间条件下计算出了最小成本的旅游路径。 短句来源 图问题
 Algorithm of the Time-constrained Multistage Graph Problem 基于带时间约束的多段图问题的回溯算法 短句来源 ：The time-constrained multistage graph problem is one spread out from the multistage graph problem．In this paper the means of expression of recursion set and the backtrace technique are introduced into the path selection in the time-constrained multistage graph，by which the minimum cost for the tourist path is worked out through calculation in a given time． 基于带时间约束的多段图问题是多段图问题的自然扩展。 该文带时间约束的多段图的路径选择，引入了递归集合的表示方法和回溯技术，在给定时间条件下计算出了最小成本的旅游路径。 短句来源 查询“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. 更多 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)。 In this paper, the function of digital circuit test-question library management system is summarized. The realistic and effective methods dealing with the processing of graph problems in test-questions, the displaying and printing of the memo-field of data-base and the realinzing of auto-composing a test paper are also presented. 介绍数字电路试题库管理系统的功能，并对试题中图形问题的处理、数据库备注型字段的显示及打印、如何实现自动组卷等问题，提出了切实有效的处理方法。 In this paper,we present a graph simplifying method which is fit for graph coloring problem. In this method,each node is deleted whenever its degree in the attained graph is less than a certain value. When graph coloring algorithms are combined with this simpliying method, their performances can be improved. We also exploit the schemes of setting the value and combining this method with GAs, and show the promising results of the simulation. Finally, it is pointed out that the method... In this paper,we present a graph simplifying method which is fit for graph coloring problem. In this method,each node is deleted whenever its degree in the attained graph is less than a certain value. When graph coloring algorithms are combined with this simpliying method, their performances can be improved. We also exploit the schemes of setting the value and combining this method with GAs, and show the promising results of the simulation. Finally, it is pointed out that the method is also fit for other graph problems such as the largest clique, maximum independent set, etc. 本文提出了一种适用于图着色问题求解的图简化方法．在这种图简化方法中，图中度小于某个特定值的节点不断被去掉，把这种方法与各种图着色算法结合使用，能提高这些算法的效率．文中分析了应如何设定其特定值，并着重叙述了与遗传算法的混合运用．最后在给出仿真结果的同时，进一步指出了本方法同样适用于求最大全连接子图等其它图论问题． << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关graph problem的内容 在知识搜索中查有关graph problem的内容 在数字搜索中查有关graph problem的内容 在概念知识元中查有关graph problem的内容 在学术趋势中查有关graph problem的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社