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

 dual graph 的翻译结果: 查询用时：0.165秒
 历史查询

 dual graph 对偶图(14)平面对偶图(0)
 对偶图
 Goodey proved that every 3-regular, 3-connected plane graph whose face degrees all 4 or 6 is Hamilton graph. The paper also discusses the Hamilton circle of the 4\|regule plane graph and the dual graph. Goodey证明每个三正则 3连通的面度全为 4或全为 6的平面图都是 Hamilton图 ,本文探讨四正则平面图与其对偶图的 Hamilton圈 短句来源 A brief proof to the key theory "The dual graph T of a simple polygon triangulation S is a tree" is given in the proof of theory "A simple polygon triangulation S is 3-Color". Then it simplifies the proof of the 3-Color problem and the Watchman Theory of Art Gallery Problem. 对“简单多边形三角形化图S是可以3-色”的定理证明中用到的关键定理:“简单多边形三角形化图S的对偶图T是一棵树”作了十分简化的证明,从而简化了3-色问题及Art Gallery问题Watchman定理的证明. 短句来源 Structural Representation Model and Algorithm for Dual Graph Based on Triangulation 基于三角剖分对偶图的结构表示模型及其算法 短句来源 In Chapter 4, we exhibit how the arithmetical conditions of the dual graph of a finite group influence its structures. 第四章主要研究有限群的对偶图的算术条件对群结构的影响。 短句来源 The paper proposes and proves a sufficient condition for the dual graph of a plane graph to be Hamiltonian. 提出了平面单图的对偶图是哈密顿图的一个充分条件 短句来源 更多
 “dual graph”译为未确定词的双语例句
 Dual graph algorithm for the volume of the city road network 城市道路网容量的对偶图算法 短句来源 With the use of Petri net simulator,nondirectional transportation network is converted into a directional network,and its dual graph, denoted by DG,is converted into its Petri net model,then automatically get the maximum flow of the transportation network by seeking the DG's shortest path, i.e. the G's minimum cut capacity. 在此基础上 ,采用 Petri网论法和计算机图形仿真法相结合的方法 ,求解运输网络最大流。 即用Petri网图仿真器把无向运输网络转化为有向运输网络 ,然后求有向运输网络 G的对偶网络 DG,再用 Petri网图仿真器将对偶网络 DG转换成 Petri图模型 ,并自动求得 DG最短路 (原网络 G的最小割容量 ) ,即运输网络最大流。 短句来源 A lower bounds algorithm for reliability analysis of network by dual graph theory 用对偶理论求网络可靠度的下界解 短句来源 4) An algorithm for reliability upper bound assessment of large-size network is presented, which is based on the principle of topological classification of node-set; and the lower bound can be also obtained by dual graph of oriented network. 4．应用图论的点集拓扑分类原理，提出一个计算大型复杂网络可靠度上界的类分法，并应用对偶理论求解网络可靠度的下界。 短句来源 In the end, this paper develops an algorithm for computing the Power diagram, which is based on the principle that the Power diagram of a weighted point set is the line dual graph of the regular triangulation of it, and examples are given to illustrate its efficiency. 最后 ,给出了平面点集的 Power图的构造算法 ,该算法利用 Power图与正则三角化互为对偶的原理 ,在点集的正则三角化的基础上构造 Power图 ,同时给出了实例以说明算法的有效性 . 短句来源 更多
 相似匹配句对
 [s,t]-GRAPH [s,t]-图及其Hamilton性 短句来源 DOUBLE GRAPH DUAL-BEAM SPECKLE INTERFEROMETRY 双片双光束散斑干涉法 短句来源 The Proof of Some Properties of The Self-Dual Graph 试论自对偶图的一些性质 短句来源 On D-Cydes in Graph 关于图中的D—圈 短句来源 Dual Lenses 双透镜 短句来源

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

 dual graph
 We present a new rule based method on dual graph contraction for transforming the run graph and its dual into MLPP graphs. Concentrating strictly on topology, it turns out that the pseudo-dual graph is conceptually cleaner and more efficient in route planning than alternative, currently used ways to deal with turn costs. The pseudo-dual graph is defined here in a new way, it is systematically investigated, and some practical applications are shown. Turn costs can be represented by a pseudo-dual graph in a way that shortest path algorithms run without modifications. Our computational experiments show that the performance of the proposed method is better than that of the dual graph approach, both in terms of computing time and memory requirements. 更多
 This paper analyzes some basic measuring schemes for state estimation in power systems. In order to use minimum telemetering equipments, her I sugg- est a way to arrange the measuring instruments and an algorithm to compute the least number of measuring points. In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced. 本文对电力系统状态估计的一些基本量测方案进行了分析,为了使用最少量的远动设备,提出了配置量测仪表的一种方法和计算最少量侧点的算法。文中把图论里Edmonds定理的树花容量扩展为最小复盖点,并得到了计算非偶图最小复盖点数的公式。 This paper discusses some properties of the Self-dual graph and simple self-dual graph.It clearly shows that simple self-dual graph is not E-graph and M- graph;and proves a necessary and sufficient condition for the self-dual graph. 本文论述了自对偶图和简单自对偶图的一些性质。明确指出简单自对偶图不是 E 图,也不是 M 图。还论证了自对偶图一个充分必要条件。 In this paper the reverse tranformation is derivcd from the reciprocity theorem. The transfer functions of the generalized inverse and the reverse of a given network are the same with different network structures. The reverse transformation of the dual graph of a given network testifies and extends the transition rules proposed in the reference. The transposition with reciprocal is such a transformation that the complex variable s in the original transfer function is replaced by 1/s, It extends the corresponding... In this paper the reverse tranformation is derivcd from the reciprocity theorem. The transfer functions of the generalized inverse and the reverse of a given network are the same with different network structures. The reverse transformation of the dual graph of a given network testifies and extends the transition rules proposed in the reference. The transposition with reciprocal is such a transformation that the complex variable s in the original transfer function is replaced by 1/s, It extends the corresponding result of the RC: CR transformation presented in the reference into the RLC networks. 本文由互易定理〔1〕引出反向变换,它与广义逆网络〔2〕具有相同的结果。对偶图的反向变换证明并推广了文〔3〕提出的易位变换规则。文中提出的倒数易位变换是拉普拉斯算子取逆的变换,它将文〔4〕提出的RC:CR变换推广到RLC网络。 << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

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