您要查找的是不是：
- improved complete graph algorithm 改进的完全图算法
- complete graph algorithm 完全图算法
- An orientation of a complete graph is called a tournament. 完全图的定向图称为竞赛图。
- Using VB to Realize Computer Ruler and Its Derived Graph Algorithm. 介绍用VB实现电脑面尺的算法及程序。
- Up to isomorphism, there is just one complete graph on vertices. 在同构意义下，几个顶点的完全图只有一个。
- The existential conditions of reflectivity and transitivity under strong or weak holding are discussed. It is proved by graph algorithm that they are complete to NSD strong holding. 本文给出了空值环境下子集依赖的概念（强、弱保持），讨论了强、弱保持下的自反律、传递律的存在条件，在此基础上用图算法证明了它们关于NSD强保持是完备的。
- In the paper, disscuss the improment of filling graph algorithm on raster Display. 本文提出了对常用的基于光栅显示器图形填充算法的改进。
- Basing on network distance, CA2DSW and CADC, the complete graph communication model in DGDN (CMDGDN) was designed. 基于网络距离机制、CA2DSW和CADC,设计了DGDN上的通信模型CMDGDN。
- And the principal graph algorithm was developed to get a better skeletonization of fingerprint. 尝试使用主曲线代替指纹细化图，并对主曲线的主图形算法进行了较大改进，使其能够得到更好的指纹骨架。
- Let K_k, C_k and P_k denote a complete graph on k vertices, a cycle on k vertices and a path on k+1 vertices,respectively. K_k;C_k;P_k分别表示k阶完全图;圈长为k的圈和路长为k的路.
- A weighted path algorithm and a connected graph algorithm were developed to automatically find multicasting faults in large multicasting networks. 在此基础上,提出两种故障定位算法,即基于经验的路径加权法和基于图论的连通图算法。
- Finally,a set of point which is made up of detouring points and pins is formed.By using the points of the set as the vertices ,a weighted complete graph is formed. 最后,以绕障点和待布点组成布线点集合,以布线点集合中的所有点为顶点构造带边权值的完全图,将布线问题转化为在带边权值的完全图中求布线点间的最短路径,从而得到最优布线路径。
- The support vector machine composed by least sequence and directed acyclic graph algorithm has been used in paper currency identification, shows the advantages of capability in dealing with scared samples, nonlinear and high dimensions. 将次序最小优化改进算法和有向无环图算法构建的支持向量机用于货币识别，充分发抨了支持向量机解决小样本、非线性和高维模式识别问题的优点。
- The Consecutiveness of Complete Graph Union 完全图并的连续性
- Various graph algorithms that use the developed digraph in deciding the location of sensors based on the concept of observability and resolution are discussed. 在此基础之上提出一种改进的基于故障诊断的计算机程序算法来设计传感器的网络分布。
- Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs. 大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。
- A Graph Algorithm to Find S-invariant of a Net 求网的S-不变量的一种图算法
- The Factor Enumeration of Complete Graph Kn 完全图的因子计数
- graph algorithm software package 图算法软件包
- ON t--EDGE COLORED COMPLETE GRAPH K_N OF ORDER N N阶完全图K_N的t边着色
