查询词典 directed graph

In the framework of graph embedding, it shows that the proposed algorithms have correspondingly extensional type of graph embedding and applicability.

在图嵌入框架下，对本文提出的算法进行了分析和比较，表明了提出的算法具有相应的图嵌入扩展方式和适用性。

This paper introduces basic concepts, representation methods and practiCal applications of computer internal division graph and external divistion graph, and presents a linear mapping method of representing internal divisio.

计算机内插图形和外插图形是计算机图形学中由图形生成图形的两种基本方法，用该方法可以生成许多有趣的图形、图案，在计算机动画模拟图案设计中有着广泛的应用。

In section four, by researching the properties of Kneser graphs, we construct the homomorphism φ between the Kneser graph and the outerplane graph. So the fractional chromatic number and chromatic number are obtained.

在第四部分中通过对Kneser图的一些性质的考察，在Kneser图与外平面图之间建立同态关系，从而得到了外平面图的分数色数与顶点色数。

A geometric structure representation of images based on the angle between spectral coefficient vectors of Laplacian graph was proposed. Graph clustering of spectral features was also investigated.

提出一种用拉普拉斯图的谱系数夹角谱特征来描述图像几何结构的方法，同时研究了基于图的谱聚类系统。

Graph coloring problem is a classic difficult problem of graph theory. It is a fundamental problem in scientific computation and engineering design.

图的染色问题是图论中的一个经典难题，它也是科学计算与工程设计中一个重要和基本的问题。

Graph coloring problem is a NP-complete one of graph and combinatorial optimization.

图着色问题是图与组合优化中的一个NP-完全问题。

The graph vertex coloring problem is the main topic of graph theory and applied in many fields, which is known as NP-complete problem.

图顶点着色问题存在于丰富的科学和工程应用中，如工序问题、排课表问题、物资储存问题等等，但它却是众所周知的NP-完全问题。

The paper gives a simulating about a graph with incidence coloring number 6, and obtains the incidence coloring number of the graph.

文中对一个关联色数是6的图进行了仿真，得到了该图的关联色数。

In the third section of this paper, on the comprehensive study of some properties of proper k-vertex-coloring、 k-edge-coloring、 and total-coloring of a graph, the standard genetic algorithm for graph coloring is researched.

在本文的第三章节中，在系统分析了图的正常k－顶点着色、k－边着色和全着色问题的基础上，对基于遗传算法的图的着色问题的求解过程进行了深入的理论分析。

In this paper, the authors transform the problem of undirected graph drawing to the problem of function optimization, then use genetic algorithms to find approximate optimal solutions of the objective function, and thus obtain a general structure of undirected graph drawing algorithms.

将一般无向图的画图问题转化为函数优化问题，用遗传算法求目标函数的最优解的近似值，从而得到无向图自动画图算法的一个一般框架。

They have quite a lot of work to do.

他们有许多工作要做。

Let us give you a more elaborate example of this process.

让我们给你这个过程的更多的详细例子。