图论

基于图论最大匹配的非Manhattan版面阅读顺序

Reading Order Based on Maximal Matching in Graph Theory for Non-manhattan Layout

图论中HAMILTON问题的进展

The Progress of Hamilton Problem in Graph Theory

第四是提出了一个以用户离散化浏览时间为度量、以图论法取得模糊相似矩阵的传递闭包的Web用户浏览模式模糊聚类算法。

In the fourth part , present a fuzzy clustering algorithm of Web users browsing pattern .

最短路径分析是地理信息系统（GIS）中网络分析的一项重要功能，等价于图论中的节点间求解最短路径问题。

Shortest path analysis is one of the basic problems of GIS network analysis .

DNA计算机原理、进展及难点（Ⅰ）：生物计算系统及其在图论中的应用

DNA Computer Principle , Advances and Difficulties ( I ): Biological Computing System and Its Applications to Graph Theory

C.图。化简开关函数的图论方法

The S. C. graph theory methods for simplification of switching functions

该方法把经典的基于相关的DNA微阵列数据聚类分析方法和图论知识相结合，能更好地揭示基因或样本之间的相似性，且避免了维数灾难问题。

It can penetrate into the similarity between tissues or genes , while avoiding the problem of curse of dimensionality .

几个图论问题在固定BT模型下的指数下界

Lower Bounds of Some Graph Problems under the Fixed BT Model

系统以网络图论为理论基础，利用面向对象的编程技术，以Visualc。

On the base of graph theory , the system makes uses of the knowledge of object oriented and takes Visual C # .

首先利用图论方法引进描写分子支化度的αN指数，该指数能分辨仅有微小结构差异的饱和链烃分子，给出支化结构的合理描述。

Using the molecular graph theory , α _N index , which is able to describe the molecular branching , has been proposed .

最大割问题是图论中的一个典型的NP困难问题。

The max-cut problem is a standard NP-hard problem in graph graphic theory .

分析现有基于图论的证书路径构造算法的基础上，提出了CA间相互协作的动态路径构造算法。

The existing certificate path construction algorithm based on graphs is analyzed , and put the cooperative and dynamic path construction algorithm .

图论中图的Dominating圈的存在

Existence of Dominating Cycle in Graphs

Q分析及图论分析揭示野大豆、半野生大豆与栽培大豆之间存在较大差异。

Q cluster analysis and graph theory analysis shows these is great diversity among wild soybeans , semi wild soybeans and cultivated soybeans .

首次提出了将GIS（地理信息系统）和图论技术应用于低压管道输水灌溉规划设计及灌溉管网优化中，在GIS支持环境下，应用图论中的最小生成树法和120°规划进行管道的最优化布置。

With the support of GIS , the minimal spanning tree theory of graph theory and 120 project theory can be applied to irrigation pipeline 's layout optimization .

这些策略均以图论为基础，对VLSI布图设计具有一定的理论和实用意义。

These strategies based on the graph theory have theoretic and practical significance in the design of VLSI .

以图论知识为基础，应用连通图中的k树树支导纳乘积，给出网络函数及其灵敏度分析的符号表达式。

Based on network graph theory , using admittance product of k-tree branches in connected graph , the symbolic expression of network function and its sensitivity are presented .

旅行售货员问题（TSP）是图论、组合最优化和计算机科学中所熟知的。

The traveling salesman problem ( TSP ) is celebrated in graph theory , combinatorial optimization and computer science .

基于图论中的连通支配集（CDS）概念，提出了一种有效的广播途径。

This paper proposes an efficient broadcast scheme based on the concept of connected dominating set ( CDS ) in graph theory .

建立了基于图论中最小独立控制集问题的DNA表面模型，并进行了实例仿真，验证了算法的可行性和有效性。

DNA surface model are established and used to solve minimum independent dominating set successfully . Then a simulation and DNA coding are given to verify the feasibility and effectiveness of DNA Algorithm .

应用拓扑图论的分割理论进行了系统划分模型的研究，并对其作了适应SOC分割的改进；

The partition theory of graphics is applied in studying on system partition theory and it is improved on to fit SOC system paration .

用数学归纳推理的方法，论证了图论中的简单平面图Gn是4着色的。

By using mathematical induction it has been proved that every plane graph is 4-colourable .

基于图论的树状河系Horton码自动建立

Automatic Creation of Horton Code of Tree-Like River Networks Based on Graph Theory

抽象出基于后桥机加工车间平面布局的AGV路径图，利用图论原理表达AGV的路径；

Abstracts AGV 's path map based on workshop 's layout , uses Graphics Theory to describe AGV 's path ;

本文通过对基础图论的研究给出平面内n个点关于它们之间的联线的若干组合结论，同时还给出对称群Sn关于它的生成元系的一个结论。

Under the research of basic graph theories , the author concludes the numerous combinations of connective lines between n points in a plane , and makes a conclusion of the generation function of symmetric group Sn .

基于图论中的Dijkstra算法进行优化，实现前往故障发生地的最佳路径分析。

Optimize the Dijkstra algorithm in graph theory , and implement to analysis the optimal path to the fault spot .

文章主要针对UE交通分配问题，介绍了连续平均法（methodofsuccessiveaverages，MSA），并利用图论方法和规划方法给出了利用连续平均法求解的C语言程序实现过程。

This paper introduces the Method of Successive Averages ( MSA ) and presents the C program for MSA based on the Graph Theory and Programming Theory .

应用这些结论还给出了rayS~-阵和rayS~-阵的图论特征刻画，及其他若干类特殊的复线性方程组的ray可解性条件。

As applications of these results , we also gave the graph theoretical characterizations of the ray S-matrices and ray S-matrices , and the ray solvable conditions on some other special classes of complex linear systems .

结合图论中的最可靠路径算法，提出了一种PKI信任度模型中优化的可靠路径算法，提高了信任的准确性。

Based on the most reliable path algorithm in graph theory , it proposes an optimization algorithm to improve the accuracy of trust relationship in the Public Key Infrastructure .

在这样的背景下，本文以人工智能，网络图论为理论基础，结合配电网地理信息系统（GIS），研究和开发了能方便、快捷得到符合工程实际规划方案的自动布线系统。

A practical and efficient automated tool for optimizing the routing of cables is presented in this paper , which is based on artificial intelligence and network graph theory combined with distribution network Geographic Information System ( GIS ) .