查询词典 intersection graph

Graph theory s 02 graph theory widely used for its own development. 40-60 20th century era matroid theory and graph theory-very graph theory, algebra and graph theory. topology theory has great development.

详细说明：图论讲义02 图论的广泛应用，促进了它自身的发展。20世纪40-60年代，拟阵理论、超图理论、极图理论，以及代数图论、拓扑图论等都有很大的发展。

Moreover, the range of m is obtained when G is a forest, a unicyclic graph, a bicyclic graph, a tricyclic graph and a tetracyclic graph, respectively, and the graph is determined when m(≥1) takes different value in its range.

给出了当G是森林、单圈图、双圈图、三圈图、四圈图时m的取值范围，并确定了m(≥1)在该取值范围内取不同值时的所有图。

In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.

论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。

The line graph of further complete bipartite graph(infinite graph of n≥6) is extendable graph.

进一步完全二部图(n≥10的无限图)的线图是可扩圈图。

One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.

其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。

Let be the maximum degree of a vertex in graph . Chen et al. conjectured that a connected graph is equitable -colorable if is not a complete graph , or an odd cycle , or a complete bipartite graph for all .

令 表图上的点的最大度数，陈伯亮等人，提出以下这个猜测：如果一个连通图不是，这三类的话，则可以用个颜色来均匀著色。

Graph theory and topology was researched to establish graphic interpreter, boolean multiplication ⊙ of a matrix is inferred and defined, and simple sub-graphs are disconnected from complex graph by the multiplication ⊙; parameterization of graph is realized through a sequence of sub-graph entities linked by constraints.

研究了图形翻译器的图论和拓扑学理论基础，推出并定义了矩阵布尔乘运算〓，使用矩阵运算〓将复杂的图形拆分成一系列简单子图；以约束关联的子图实体序列实现图形的参数化。

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，这样的作法对於具有时戳性质的图形探勘将更有效益

This paper presents and discusses some generating principles and methods of the test graph on the system level fault diagnosis about random test graph,limit t fault diagnosable test graph, t fault diagnosable test graph and so on.

提出并研究了系统级故障诊断测试图中任意测试图、受限t可诊断系统测试图和t可诊断系统测试图的生成原理及方法，还给出了一个典型测试图的生成实例。

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

You can snipe the second and third union leaders from this position.

您可以鹬第二和第三工会领袖从这一立场出发。

Aiming at the currently shortage of XML streams quality detecting, this paper proposes a new forecasting method of XML streams quality by least squares support vector machines, which is used the method of XML keys' vector matrix as windows, and vector product wavelet transform to multilevel decompose and refactor the XML streams series, that can fulfill real-time checking demand of XML quality, and ensure constraint, consist- ency and integrality. For even more adapting net load, it proposes a control strategy by weight and adaptive adjustment to ensure XML streams quality.

针对当前XML数据流质量检测存在的不足，提出构建XML键的矢量矩阵作为窗口，利用矢量积小波变换多级分解与重构XML数据流，再结合最小二乘支持向量机对XML数据流质量进行预测的一种方法，满足XML数据流质量重构时实时检测的要求，保证XML数据的约束性、一致性与完整性；为了更好的适应网络负载，采取加权与自适应窗口调整等调度策略充分保证XML数据流的质量检测。