全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 graph problem 在 水利水电工程 分类中 的翻译结果: 查询用时：0.333秒
 历史查询

 graph problem 图问题(2)
 图问题
 Another Solution to Multistage Graph Problem Based on Water Channel Principium 基于水槽原理的多段图问题的另一种解法 短句来源 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. 也即是根据水流在水槽中的流动情况,归纳出其特点,将其与多段图的特点进行对比分析,得出相同点,然后利用其性质定义了一种特定性质的水流,提出了多段图问题的另一种解法。 短句来源

我想查看译文中含有：的双语例句

 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. 更多
 Traditional solutions to multistage graph problem are based on comparison. Enlightened by water channel principium, this paper tries to solute the problem in another way. 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. In the end, the nature and applicable scope of the algorithm are discussed. 针对多段图问题的传统的基于比较的算法,受水槽原理启发,尝试从另外一种途径解决这个问题。也即是根据水流在水槽中的流动情况,归纳出其特点,将其与多段图的特点进行对比分析,得出相同点,然后利用其性质定义了一种特定性质的水流,提出了多段图问题的另一种解法。最后,讨论了此算法的本质和适用范围。
 相关查询

 CNKI小工具 在英文学术搜索中查有关graph problem的内容 在知识搜索中查有关graph problem的内容 在数字搜索中查有关graph problem的内容 在概念知识元中查有关graph problem的内容 在学术趋势中查有关graph problem的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社