14. A new method of obtaining linkage characteristic polynomials based on the adjacencymatrix of the kinetic chain is presented in the paper.
本文介绍了一种建立在运动链关联矩阵基础上求解运动链特性多项式的新方法。
来自互联网
15. In order to dealing with the clustering considering the condition of planar adjacency relationship, the concept adjacency matrix is defined.
面对满足二维空间邻接条件的聚类问题，定义了邻接矩阵的概念。
来自互联网
16. Through the adjacencymatrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
通过邻接矩阵，计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。
来自互联网
17. Even on the form to input an undirected graph edge, the establishment of the adjacencymatrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
来自互联网
18. The AdjacencyMatrix of the Directed Graph is easy to build, but the reach-relation of factors is more useful when building the structure model.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
来自互联网
19. According this, the method that can reproduce the topology structure of the object network by using figure theory and adjacencymatrix was discussed.
据此，提出用图论和矩阵重现目标网络拓扑结构的邻接矩阵法。
来自互联网
20. This paper also proposes the qualities of adjacencymatrix, derives the theorem of the relations between isomorphism and equivalent adjacency matrix.
提出关联矩阵的性质，推导出同型机构和等价关联矩阵关系的定理。
来自互联网
21. One helpful way to determine the isomorphism of graphs is to use elementary operations on a graph adjacencymatrix so as to transform one matrix into another.
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
来自互联网
22. Construct the skeleton tree′s adjacency matrix, then define a Topology Signature Vector and compute the distance of matching node pair by the difference of the TSV.
23. This paper discusses the application of adjacencymatrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
来自互联网
24. After turning it into a Designate Problem and analyzing the opposite angles of a rectangle in the AdjacencyMatrix about its figure, this paper gives an approximate algorithm about it.
25. It is shown that after the adjacencymatrix of flow network is input, the algorithm can be employed to generate the model of flow network automatically and the practice with this method I...
利用该算法，只需输入管道网络的邻接矩阵，即可自动产生流量压力分布计算的数学模型并进行实时动态求解。
来自互联网
26. Since all elements on the primary diagonal are 1s and the dimensions are less than 2006, the graph with A2006 as its adjacencymatrix is the transitive closure of the graph represented by a.
27. In this paper, we get the diameter of three kind of self-complementary and then give a necessary and sufficient condition from matrixadjacency when the diameter is 2 or 3.
