查询词典 complementary graph

Meanwhile, the experiments show that the multi-level swarm intelligence refinement algorithm is better than the multi-level tabu search refinement algorithm, especially in view of the probability that the approximate global minimum partition of the coarser graph may be the local minimum partition of the finer graph. Furthermore, the experiments show that the multi-level ant colony optimization refinement algorithm achieves more performance improvement than the multi-level particle swarm optimization refinement algorithm, using the gain of vertex more effectively.

实验数据反映出，针对最小图上的全局最优剖分可能是初始图的局部最优剖分、粗化图上的全局最优剖分可能是细化图的局部最优剖分的情况，基于群智能的多水平迁移优化算法相比基于禁忌搜索的多水平迁移优化算具备更强的逃离局部最优的能力；基于蚁群的多水平迁移优化算法相比基于微粒群的多水平迁移优化算法，对收益值的启发信息更为有效地利用，取得最佳的性能改进。

Let G be a double-outer plane graph, V, E, F be the set of points, edge and face, a plane graph G is k-total colorable, if the elements of V E can be colored with K-colors, any two distinct adjacent or incident elements receive different colors.

设G是一个双外平面图，V，E，F分别为双外平面图G的点集，边集和面集。G的全色数X是使得V∪E中的任意两个相邻或相关联的元素间均染不同颜色的最少颜色数。

The graph coloring problem is one of important branchs of graph theory.

图的着色问题是图论中的一个重要研究领域。

In this paper the level of elementary graphs is explored, and the D^2 of any non-bipartite elementary graph is proved to be a complete graph.

本文研究了基本图的水平，证明了对于任何非二部的基本图，它的D^2是一个完全图。

And two important growing ways: star-like graph growth and complete graph growth.

增长和择优机制是无标度网络中两个最重要的演化机制，已发现比较重要的择优机制有度择优和秩次择优，比较重要的增长方式有星形图增长和完全图增长。

For example, say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph.

举个范例，我们希望知道一个有 n 个顶点的图形中的两个顶点是否位於图中同一个连接元件。

A graph in which any two vertices are connected by a path is called connected graph.

一个图中如果任意两个顶点都有一条路相连，则称之为连通图。

If any two nodes in a graph can be connected by a path along edges ,the graph is said to be connected.

如果图中任意两个结点间都能够用一条路径沿着边线连接起来，那么该图则被称为连通的。

In general,given two vertices V and W in a graph,it is not always possible to find a path connecting them;such a path will exist only when the graph is 'in one piece'.

D8 |一般而言，给定图的两个顶点V和W并非总能找到连接它们的路；只有当图是"在一块中"时，这样的路才存在。

In general,given two vertices V and W in a graph,it is not always possible to find a path connecting them（see Fig.3-9）;such a path will exist only when the graph is"in one piece".

一般而言，给定图的两个顶点V和W并非总能找到连接它们的路（如图3-9所示）；只有图"在一块之中"时，这样的路才存在。

Fostering the concept of multi-culture firmly and mastering the development of advanced culture correctly are conductive to resisting terrorism, separatism of nationalities and ultraism of religion, which is of great academic theoretical, immediate and profound historical si...

牢固树立多元文化的理念和正确把握先进文化的发展方向，有助于在世界范围内自觉地抵制恐怖主义，民族分裂主义和宗教极端主义。不仅具有重大的学术理论意义，而且也具有重大的现实意义和深远的历史意义。

But if anyone walks in the night, he stumbles, because the light is not in him.

11：10 若在黑夜行走，就必碰跌，因为那光不在他里面。