片语

maximum clique problem mcp最大团问题

And Morphological Clique Problem和形态学集团问题

clique cover problemIn computational complexity theory, finding a minimum clique cover is a graph-theoretical NP-complete problem. The problem was one of Richard Karp's original 21 problems shown NP-complete in his 1972 paper "Reducibility Among Combinatorial Problems".

Maximum Clique Problem最大团问题

Maximal Clique Problem引言最大派系问题

max clique problem最大团问题

英汉例句

• owing to the maximum cardinality clique problem and the maximum weight clique problem of graphs to be np-complete, there are no effective methods to solve these two problems.

  图的最大团和最大权团都是着名的np完全问题，没有非常有效的算法。

• the maximum clique problem has some equal descriptions, and the research methods differ on different models.

  最大团问题有相当多的等价的数学描述，并且针对不同的模型具体的研究方法也有一定的差别。

• given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices(i. e. , a clique) having the largest total weight.

  给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。

• the maximum clique problem is one of the classical np-complete problems from combinatorial optimization.

  最大团问题是组合优化中的一个经典的np-完全问题。

• the main contents are organized as follows:in chapter 1, some definitions and optimization models about the maximum clique problem are introduced.

  在第一章，介绍了最大团问题的有关定义和优化模型。

• a new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.

  提出了关于最大团问题的一种新思路基于平均度排序的局部枚举算法。

• biomolecular computing has been successfully applied in computing np complete problems such as hamiltonion path problem, maximal clique problem and sat problems in boolean calculation, etc.

  生物分子计算已成功地应用于计算哈密 顿路径、最大集合以及逻辑运算中的sat类问题等np完全问题。

• can i just say that we don't have a clique problem at this school?

  我可以说在这所学校里我们没有任何圈子问题吗？