clique problem

常見(jiàn)例句

The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大團(tuán)問(wèn)題是一個(gè)經(jīng)典的圖論問(wèn)題，其目標(biāo)是找出給定的某個(gè)圖的最大完全子圖。
A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.
提出了關(guān)于最大團(tuán)問(wèn)題的一種新思路基于平均度排序的局部枚舉算法。
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.
圖的最大團(tuán)和最大權(quán)團(tuán)都是著名的NP 完全問(wèn)題，沒(méi)有非常有效的算法。

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