查询词典 graph

Ore gave an upper bound of the number of edges of an undirected graph in terms of order and diameter of the graph.

Ore通过图的顶点数和直径给出无向图的最大边数。

In the algorithm, at first a weighted and undirected graph is constructed among data points in a dataset according to the model, where each data point corresponds to a vertex in the graph, and is regarded as an agent who can move randomly in space.

在此算法中，数据集中的样本点根据改进的随机游动模型，生成有权无向图，其中每个样本点对应图的一个顶点，并且假设每个顶点为可以在空间中移动的Agent。

The paper based on component technology and COM, study and design the vector graph component, realize the function of vector graph, such as the input and output of map, the display of map, mutual plot with mouse, etc.

本文以组件技术和组件对象模型(COM，Component Object Model)为基础，研究和设计GIS矢量图形组件，实现GIS系统的矢量图形功能，如地图的输入输出、地图的显示、鼠标交互绘图等。

Compare to existing results for general graph, new lower bound on the size of the minimum feedback vertex set of-star graph is given based on its special structure.

本文主要讨论了关于组合星图反馈结点集的下界问题，在基于组合星图的性质和已有相关结果的基础上，给出了组合星图反馈结点集的新的下界。

The Bi-Cayley graph BC of G with respect to S is defined as the bipartite graph with vertex set G ×{ 0,1} and edge set {(g, 0)(sg, 1): g ∈ G,s ∈ S}.

Bi-Caylcy图BC是一个二部图，它的顶点集为G×{0，1，边集为{(g，0)(sg，1)：g∈G，s∈S。

The vertex set of the complete graph Tof a graph G is the union of the vertex set of G and the edge set of G,two elements are adjacent in T if they are neighbour elements in G.

全图T是以V和E为顶点集，当T的两个顶点在G中是邻元素时，它们邻接。

From the graph, we can know that the graph of y=kx+b, is crossing the point of (0,b), and is parallel with the line of y=kx. And in the point of (0,b), o is x and b is y . In this situation, zero can be the divisor. It can be the scientific gist.

从正比例函数和一次函数的图象可知，一次函数y=kx+b在坐标平面上的函数图象是经过(0，b)且平行于正比例函数y=kx的一条直线，这其中的点(0，b)，0表示x，b表示y，在这样的情况下就成了零作除数的情景，这可说是零能作除数的科学依据。

The results of its application indicates that it can utilize graph libraries and information libraries in existenceef ficiently and enhance integrating-degree of information within graph document, and be appliable to many areas of construction of digital city and management for traditional equipment account books and project drawings of enterpr ises or institutions.

应用结果表明，该技术能高效利用现有的图库和信息库资源，适用于企事业单位传统的设备台帐管理、工程图纸信息管理以及数字化城市管理等诸多领域，能较大幅度地提高图形文档的信息集成能力。

Based on the classical Apriori algorithm, a novel graph mining algorithm, Apriori-Graph, is proposed.

在经典的Apriori算法的基础上，提出了一种图挖掘的新算法Apriori-Graph。

A matching graph of class-buck and class-stack is obtained by a simplifying rule to guarantee the correctness of curriculum schedule. Employing the matching graph as the initial solution, Tabu search is introduced, the index of which is the weighted summation of the principle of categoricalness, rationality, and humanization.

在此基础上，引入禁忌搜索算法，以排课的完备性原则、合理性原则和人性化原则的加权和为目标函数，以随机二维权值矩阵生成的匹配偶图为初始解，对二维权值矩阵进行扰动构成搜索邻域，以生成的匹配偶图为禁忌对象，采用全局藐视准则，获得最优的排课方案。

Now she was hungry and angry.She began to smoulder.

现在她又饿又气，她开始流露难以抑制的怒火。

You have placed our iniquities before You, Our secret sins in the light of Your presence.

诗90：8 你将我们的罪孽摆在你面前、将我们的隐恶摆在你面光之中。