Euler solved this problem in 1736. He changed this problem into the first graph theory problem by abstract analyzed method.
欧拉在1736年解决了这个问题，他用抽象分析法将这个问题化为第一个图论问题。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
In the last, the paper designs and analyses the Graph Theory algorithm and drives a conclusion that the problem of the arranging of curriculum schedule is NP - hard problem.
在文章的最后我们对课表超图的图论算法进行设计与分析，并得出该问题是一个NP难问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
Isomorphism identification is an important and difficult problem in mechanism type synthesis, it is also one of the most difficult problems in graph theory.
同构识别是机构类型综合中一个重要而又困难的问题，同时，也是图论中非常难解决的问题之一。
Maze problem is a classical problem in graph theory and other fields.
迷宫问题是图论等领域中的经典问题。
This paper analyzes the theory and the method in solving the network problem by the mathematics model of linear programming and graph theory.
分析了用线性规划、图论的方法解决网络问题的理论和算法。
As for the synthesis problem of distillation separation sequences, the method of graph theory is applied to study network superstructure.
针对精馏分离序列综合问题，运用图论方法研究网状超级结构。
The shortest path problem is a typical problem in graph theory, it has a wide range of examples in production and daily life.
最短路径问题是图论中的典型问题，在生产和生活中具有广泛的实例。
Bayesian network is developed by the integration of probability with graph theory. It provides a natural tool for dealing with problem of uncertainty.
贝叶斯网络将概率理论和图论相结合，为解决不确定性问题提供了一种自然而直观的方法。
Under the given locations of candidate pump station, the graph theory was used to analyze the problem.
在泵站可选位置确定的条件下，采用赋权有向图来表示工艺方案优化设计问题。
The network(planning)is an approach applying the longest route problem and its solution of the directed graph in the graph theory to scheduling, and it's also one of the dynamic programming approach.
网络（计划）分析是图论中有向图的最长路线问题及其解法用于计划编制的一种方法，也是动态规划的方法之一。
The max-cut problem is a standard NP-hard problem in graph graphic theory.
最大割问题是图论中的一个典型的NP困难问题。
In this paper, we study the problem of a kind of matrix in the sense of minimax algebra by using graph theory method and present the property of matrix power element.
用图论方法对一类极大代数意义下矩阵进行了研究，给出了矩阵方幂元素的性质。
The embody investigation works as follows:(1) Use the Graph theory method in mathematics to solve the problem of limit equilibrium FEM computation of slope.
具体研究工作如下： （1）、采用数学上的图论的方法解决边坡极限平衡有限元问题。
Based on the calculated results of finite element method, the problem of slope stability could be converted into searching for the shortest path in graph theory.
基于有限元计算结果，将边坡稳定性问题转化为图论中寻找最短路问题。
The coloring problem is always important problem in graph theory. In the discrete mathematics and combinatorial analysis, the coloring problem has a wide range of applications.
图的着色问题一直是图论中的重要问题，并且在离散数学和组合分析中有着重要的应用。
Professor Ernest s. Kuh attacked this problem from a theoretical background of graph theory, optimization theory and other mathematical tools, and has obtained remarkable results.
葛守仁教授应用图论、优化理论等数学工具，对集成电路的布线进行了理论研究，并已经取得了可喜的成果。
How to determine the isomorphism of graphs is a difficult problem of graph theory, which has not been completely solved so far.
图同构的判定性问题是图论理论中的一个难题，至今没有得到彻底解决。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
应用推荐