查询词典 bar graph

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

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.

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

We apply the results in Chapter 2 to the equitable list coloring of graphs and prove that a graph G is equitably △-choosable if G is a plane graph without i-cycles, 3 ≤ i ≤ 5, or a plane graph without 4-cycles(or 5-cycles) and 6-cycles.

从而得出不含3-圈，4-圈和5-圈的平面图和不含4-圈(或5-圈)和6-圈的平面图GΔ(G≥6均有一个Δ-均匀列表染色。

In a graph-theoretic version for a graph G,it is to find a set F of added edges such that the graph G+F is chordal and |F| is minimized.Here the minimum value |F| is called the finll-in number of G,denoted as f.

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G+F是弦图。

The fill-in minimization problem comes from the elimination process of sparse matrix computation. In a graph-theoretic version for a graph G, it is to find a set F of added edges such that the graph G+F is chordal and |F| is minimized.

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G+F是弦图。

If G is a {2K_1+K_2, C_4}-free graph, we show thatifα＞3 then G is a split graph, and ifα=3 then for any independentset S of cardinality 3, G-S is a chordal graph or G-S?

如果图G不含与4-圈和2K_1+K_2同构的导出子图，我们证明了如果α＞3，那么G是一个split图；如果α=3，那么对于G的任一个有三个元素的独立集S，G-S是一个弦图或者G-S？

That is, network coding has a larger rate region in a multicast CIOQ switch. Moreover, the graph-theoretic characterization was given out. With the concepts of stable set polytope from the enhanced conflict graph, it is pointed out that computing the offline schedule can be reduced to certain graph coloring problems.

文章证明了对一个流中的分组进行线性网络编码可以承载不允许网络编码时不能够承载的交换流量模式，也就是说，网络编码允许CIOQ交换结构在实现组播服务时有更大的速率区域，并给出了基于图论方法的描述。

It is advisable that Chinese summary is controlled with 300 words, english summary should agree with meaning of Chinese summary article, with 200 substantival and advisable. 5, graph, watch is followed civil appear, have axiomatic sex, graph with necessary in the limit of, avoid by all means and literal content repeat, it is clear that line of value of coordinate of graph Chinese word, symbol, freely, mark value must be written, mark eye should use standard physical quantity and unit symbol, form is used 3 lines...

中文摘要以300字左右为宜，英文摘要应和中文摘要文意一致，以200个实词为宜。5、图、表随文出现，有自明性，图以必要为限，切忌和文字内容重复，图中文字、符号、纵横坐标值、标值线必须书写清楚，标目应使用标准的物理量和单位符号，表格采用三线。。。

The concept"attachable graph"and the enumeration method of pates and circuits on the graph are proposed. With the graph, the gear arrangement problem can be solved. The new method and procedure of GLM type synthesis are presented. With general type synthesis method, Attachable Linkage Kinematic Chain could be generated.

用一般平面连杆运动链类型综合的方法可生成ALKC，然后通过在ALKC上配置齿轮模块得到NGLKC，再在NGLKC上用一定方法设置焊点生成WGLKC，进而选取机架和原动件，即可完成GLM的类型综合。

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

Although translator has turned from being a crystal ball by which the original culture can unrestrainedly penetrate to another crystal ball by which the target culture can freely traverse, the translator's personal embodiment, in the process of cognitive act, are still absent in translation studies. Translators are still subjects without body or simply disembodied subjects.

译者虽然由原语文化可以自由穿透的玻璃球变成了译语文化可以自由穿越的玻璃球，但译者认知过程中的个体体验在翻译研究中依然缺席，译者依然仅仅是一个没有躯体体验的主体。

Chillingly, he claimed our technology is 'not nearly as sophisticated' as theirs and "had they been hostile", he warned 'we would be been gone by now'.

令人毛骨悚然的，他声称我们的技术是'并不那么复杂，像他们一样，和"如果他们敌意"，他警告说，'我们将现在已经过去了。