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