基本解釋[計算機科學(xué)技術(shù)]集團型問題英漢例句雙語例句The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.最大團問題是一個經(jīng)典的圖論問題，其目標(biāo)是找出給定的某個圖的最大完全子圖。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)于最大團問題的一種新思路基于平均度排序的局部枚舉算法。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.圖的最大團和最大權(quán)團都是著名的NP 完全問題，沒有非常有效的算法。權(quán)威例句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 resignsclique problem更多例句詞組短語短語clique cover problem 集團型覆蓋問題Maximal Clique Problem 引言最大派系問題;最大派系問題;問題Maximum Clique Problem 最大團問題;求解最大團問題And Morphological Clique Problem 和形態(tài)學(xué)集團問題maximum clique problem mcp 最大團問題clique problem更多詞組專業(yè)釋義計算機科學(xué)技術(shù)集團型問題