maximum clique problem
基本解释
- [计算机科学技术]最大团问题
英汉例句
- The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的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.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。 - A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.
提出了关于最大团问题的一种新思路基于平均度排序的局部枚举算法。
双语例句
专业释义
- 最大团问题
The maximum clique problem is an important NP complete problem in graph theory. Prebious algorithms are either applicable only to some particular graphs or in need of exponential time cost.
最大团问题是图论中重要的NP完全问题，目前求解最大团问题的方法只适合某些特殊的图，活则消耗时间长，求解效率低。