查询词典 interval graph

It allows each edge of a graph data set to be with different interval-gap value. For example, given a graph with n edges, the interval-gap concept provides n interval-gap values, Min_Gap and Max_gap, for these edges correspondingly. By incorporating this concept into the graph mining, discovering frequent sub-graph with time constraints can be more effective.

在本论文中提出了区间间隙的概念，主要即是由固定的Min_Gap、Max_gap将之修改调整为弹性的Min_Gap与Max_gap，此区间间隙弹性的地方即在於图形资料集里的任两个节点所串连的边皆会有不同的区间间隙，也就是一个具有n个边的图形里，将会有n个不同的区间间隙值，也就是Min_Gap与Max_gap，这样的作法对於具有时戳性质的图形探勘将更有效益

The first proposes that any differentiable function defined on an interval has a mean value, at which a tangent line is parallel to the line connecting the endpoints of the function's graph on that interval.

第一个定理指出，定义在一个区间上的任何可微分的函数都有一个平均值，在该点的切线与该区间上函数曲线两端的联机平行。

If the graph of the function is a consecutive curve at the interval ［ a , b ］ together with , the function has a zero point at the interval. That is, exists and it results in . Therefore, the x o is the root of the equation

结论〗：如果函数在区间［ a ， b ］的图象是连续不断的一条曲线，并且有，那么，函数在区间内有零点，即存在，使得，这个 x o 也就是方程的根。

Live-range splitting can be used to make the graph satisfy the optimal interval coloring condition.

当不满足最优区间着色的条件时，可以通过分割数组的生命周期来使之得到满足。

In this paper, an algorithm is presented, which computes the maximum clique based on the notion of interval representation of a graph.

以图的区间表示的概念为基础，提出了一种求解最大团的算法。

And we describe a MAXCL algorithm to find a trivial lower bound for the chromatic sum on an arbitrary interval graph.

并且在本文中我们描述了一种MAXCL算法，从而可以找到任意一个区间图的色和的一个平凡的下界。

This change may be showed on graph of level or altitude interval. The graph inflexion is the small structure's starting or ending.

这种变化可以从两条巷道中线水平间距或者曲线图反映出来，曲线图上的拐点即为小构造出现的位置或尖灭点。

As the general interval coloring problem is NP-complete, a property of the program, namely the containment of arrays\' live-ranges, is used to decrease the hardness of interval coloring and simplify it as an interval coloring problem for superperfect graph. Based on this, a judgment theorem for optimal interval coloring together with the implementation algorithm is proposed.

由于一般的区间着色问题是NP完全问题，我们利用程序所具有的一个性质，即数组生命周期的包含性来降低区间着色的难度，将一般的区间着色问题简化为超完美图的区间着色问题，并据此提出了实现最优区间着色的判定条件以及实现算法。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。

This paper proved that the MAXIS algorithm is a 2-approximation to the SC of proper interval graphs with Bounded Degree and α≤ω. where α is the maximum degree of vertices of graph, n is the number of vertices of graph.

本文证明了对一类特殊的真区间图Δ≤(4n~(1/4)且α≤ω，其中Δ是图G中点的最大次，n是图G的点数，α是G的最大独立点集所包含的点数，ω是G的最大团所包含的点数，MAXIS算法是解决其染色和问题的2-近似算法。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失