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 paper introduced two kinds of graph theory algorithm which is suitable to select other nodes and estimate relating path in actual system on basis of finding out shortest path of node.
在分析过程中以寻求节点最短路径为基础，介绍了两条图论算法，并且这种算法适用于实际系统中其它节点选取以及关联路径的判断。
Utilizing the shortest path algorithm in Graph Theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part.
运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。
Some theories of operations research, such as Graph Theory, double sweep algorithm, and Queuing Theory, and their applications in the configuration design of RMS are addressed.
论述了图与网络理论、双向扫视算法、排队论等运筹理论，以及它们在可重构制造系统的组态设计中的应用。
The paper studies computer algorithm of valve shutoff in fault of heating network by graph theory, and works out applying program.
应用图论理论研究了供热管网故障时关阀方案的计算机算法，编制了实用程序。
An algorithm based on graph theory for non-rigid shape matching is presented.
提出了一种基于图理论的非刚体形状匹配算法。
The rule of Computer Control System′s faults spread is studied in this paper, which put forward an algorithm of fault detection with graph theory and some suppose of faults.
文章对控制系统故障传播的规律进行了研究，运用数学图论的有关理论提出了一种基于图论的故障定位搜索算法；
The algorithm is based on the principle of flow graph theory and set theory.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
This paper also designs the computerized critical path algorithm and the network graph drawing algorithm based on the graph theory and project management technique.
论述了图论的技术以及项目管理技术，并且根据图论技术和项目管理技术设计出了关键路径算法以及网络图绘制算法。
As a mathematic branch studying the graphical composite relation and fabric, the graph theory can be expediently used in solving graphical problems with computer algorithm.
图论是研究图的组合关系及结构的一个数学分支，可以方便地实现图形同计算机算法的结合。
In this paper we also discussed the rule analysis theory. By defining trigger graph, active graph and de-active graph we gave a static rule analysis algorithm of deciding of the rule termination.
本文还探讨了规则分析理论，通过定义触发图、活化图和惰化图，给出一个规则终止性静态分析算法，提高了规则终止性判定的准确性。
Graph theory model of using locative is set up by analyzing the characteristics of using locative. Then algorithm of it is given by construction method.
通过分析车站作业过程和调车机的解编特性，建立调车机车运用问题的图论模型，运用构造方法给出调车机运用问题的使用算法。
The shortest path algorithm is a hot subject in graph theory, geographical information system, and traffic advisory and so on.
最短路径算法是图论、计算机网络、地理信息系统、交通咨询等诸多领域中研究的热门课题。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
So this article bases on the structural holes theory and discusses a computer-aided egocentric network analysis system which USES the matrix analysis algorithm and the network graph technology.
本文正是以结构洞理论为基础，研究了一个计算机辅助的个人人际网络分析系统。
This study is based on smart planning and plan recognition theory, research tools are planning graph algorithm, using a database programming model to achieve the user plan recognition algorithm.
本文的研究基础是智能规划和规划识别理论，研究工具是规划图算法，采用有库规划模型实现用户规划识别算法。
Prom the viewpoint of graph theory, we discuss the properties of a judgement matrix with ordinal consistency and propose an algorithm to measure the ordinal consistency of the judgement matrix.
本文从图论的观点，讨论次序一致性判断矩阵的性质，并给出一种检验判断矩阵次序一致性的方法。
This paper also designs the computerized critical path algorithm and the network graph drawing algorithm based on the graph theory and project management technique.
由于本系统以网络图的形式进行工程管理，因此提供了一个简单、直观制作网络图的平台。
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.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
应用推荐