英语释义

1. a graph consisting of vertices and line segments such that every line segment joins two vertices and every pair of vertices is connected by a line segment

片语

complete spilt graph完全分裂图

complete virtual graph连通图的基础之上

complete multipartite graph完全多重图

Complete incidence graph完全关联图

Complete Goal Graph完全目标图

complete split graph完全分割图

complete bipartite graphIn the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.

complete bipartite graph km完全二部图km

英汉例句

• complete graph algorithm(cga) is used to present faa because to perform the whole emc analysis in eis, which no more than 5 radios, cga is faster than enumerative method.

  提出解决频率指配问题的完全图算法，全面预测分析了电台数目小于等于5的电子信息系统的电磁环境。

• the generative rule of arbitrary n-rank k-regular simple graph is studied, and the method of recursively generating arbitrary n-rank k-regular graph from the simple complete graph is put forward.

  研究了任意n阶k正则简单图的生成法则，提出了由简单完全图递归生成任意n阶k正则图的方法。

• up to isomorphism, there is just one complete graph on vertices.

  在同构意义下，几个顶点的完全图只有一个。

• an improved algorithm for mining association rules with multiple minimum supports using maximum constraints based on complete graph is put forward.

  提出了基于完全图的最大约束条件下多支持度阈值关联规则挖掘改进算法。

• the complete graph algorithm is advanced and it combines complete graph algorithm and four level forecast model to perform whole emc analysis in electronic information system which has less radio.

  提出完全图算法，并将完全图算法和经典的四级预测模型结合使用，进行了小规模电台数目电子信息系统的完整的电磁兼容性分析，完成了系统内的频率指配。

• level diagram example shows the practicality and effectiveness of the construction theorem and counting theorem, which is a simple and easy method to construct a complete graph of the spanning tree.

  平图例子验证了构造定理和计数定理的实用性和有效性，是构造一个完全图的生成树的简单易行的方法。

• in this article, we give some methods and results concerning the decomposition of a complete graph into the union of some disjoint cycles.

  本文给出关于将完全图分解成边相离的循环的和的几个结果。

• at the same time, in order to avoid multi-pass scanning the entire database, the complete graph is used to divide mining region and mining frequent itemsets only in possible scope.

  同时，为了避免对整个数据库进行扫描，提出利用完全图划分挖掘区域的方法，只在可能产生频繁项集的范围内进行挖掘。

• a contour tracking algorithm with simultaneous edge feature detection is proposed and the character contour is separated from the complete graph contour of the scanned image based on rules.

  提出了同步边缘特性检测的轮廓跟蹤算法，并基于规则从扫描图像全图轮廓中分离字符轮廓；