clique problem

基本解释

The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.
提出了关于最大团问题的一种新思路基于平均度排序的局部枚举算法。
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 完全问题，没有非常有效的算法。

But Hirohisa Fujii's main problem was not illness so much as a case of bad blood in Mr Hatoyama's ruling clique.
ECONOMIST: Japan's finance minister resigns