interval graph

interval graph的基本解释

-

区间图

与interval graph相关的网络例句 [注：此内容来源于网络，仅供参考]

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.

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

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.

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

Keywords: Compile-time memory allocation,Main memory management,Interval coloring,Super-perfect graph

初步评测表明，我们的分配算法是有效的编译时管理主存手段。

与interval graph相关的网络解释 [注：此内容来源于网络，仅供参考]

interval graph：区间图

右闭区间 interval closed at the right | 区间图 interval graph | 收敛区间 interval of convergence