maximum clique problem

常見例句

The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大團(tuán)問題是組合優(yōu)化中的一個(gè)經(jīng)典的NP-完全問題。
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)問題是一個(gè)經(jīng)典的圖論問題，其目標(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)問題的一種新思路基于平均度排序的局部枚舉算法。