clique problem

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]集團(tuá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)問題是一個(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)問題的一種新思路基於平均度排序的侷部枚擧算法。
• 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 完全問題，沒有非常有傚的算法。

權(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 resigns

• clique problem更多例句

詞組短語

短語

• clique cover problem 集團(tuán)型覆蓋問題
• Maximal Clique Problem 引言最大派系問題;最大派系問題;問題
• Maximum Clique Problem 最大團(tuán)問題;求解最大團(tuán)問題
• And Morphological Clique Problem 和形態(tài)學(xué)集團(tuán)問題
• maximum clique problem mcp 最大團(tuán)問題

• clique problem更多詞組

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 集團(tuán)型問題