图论基本解释

汉语拼音:tú lùn

1.世纪关于七桥问题的研究。

2.世纪中期随着电子计算机的应用迅速发展。与运筹学、信息论、控制论等有密切联系,在科学技术和经济学等诸多领域有广泛应用。

图论详细解释

图论 [tú lùn]
  1. 以图作为研究对象的数学理论,是应用数学的一支。图可以表示为由某些点及连接这些点的连线组成的图形,也可抽象的以数学模型表示之。

图论双语翻译,图论在线翻译例句

    • These concepts will prove to be quite useful in our subsequent work in graph theory.

      这些概念在我们往后的图论工作中,将是很有用的.

    • Most of the definitions and concepts in graph theory are suggested by the graphical representation.

      图论中的大多数定义和概念是根据图形的表示提出来的.

    • For example, will graph - theoretic abstraction of network topology eventually be insufficient?

      比如, 用图论来作为对网络拓扑的抽象还能行 吗 ?

    • Graph theory methods have great importance in the field of prediction of protein structure.

      图论方法在蛋白质结构预测中占有重要地位.

    • This algorithm is modified so that it can deal with routing problem in SDH network dynamically.

      引入了图论中的最大容量算法,作了必要的修改,使之适用于SDH光纤网 的规划,并具有一定的动态性.

    • SAP matrix graph theory algorithm for getting the basic idea is to map shortest path problem.

      图论算法求SAP矩阵的基本思想是图的最短路的问题.

    • At the same time , the Optimazition Problem in Graph Theory became the focus of research nowadays.

      而图论中的优化问题是近代图论领域研究的焦点问题之一.

    • The theory involved takes its reference from the Matching of Bipartite Graph theory.

      问题的理论部分来自于图论的二分图匹配.

    • After the identification of oscillation center, a dynamic splitting scheme based graph theory is realized.

      最后,根据失步中心的分布情况, 利用图论的思想实现了文中的动态解列方案.

    • The identification of graphs'isomorphism is one of the basic problems in graph theory.

      图的同构判定是图论学科的基本问题之一.

    • The chart theory can describe the direction and weigh of the brittle spread model.

      图论针对网络系统可以描述出系统脆性传播的方向和权重.

    • The illustrates mathematical model and its natures, demonstrates the graph theory methods for mathematical model.

      阐述了数学模型及其本质,以典型实例论述了数学模型的图论方法, 并介绍用图研究的一些领域.

    • During designing process, illustration and conjunction matrix are used for validating the network topology structure.

      在设计过程中, 运用图论的方法,通过计算关联矩阵,验证了网络拓扑结构的合理性.

    • Two algorithms, graph cut and random walk based on graph theory, were applied to motion segmentation.

      将两种基于图论的算法图切割与随机游走应用于运动对象的分割.

    • A feasible tie - line set were developed on base of adjacent matrix, path matrix and path sub - matrix.

      结合图论中的邻接矩阵, 提出路径矩阵和路径子矩阵的概念及形成方法,进而提出求取可行 联络线 集合的算法.