这个问题是寻找无权图的最大团问题的推广。
This problem is a generalization of the problem of finding the maximum cardinality clique of an unweighted graph.
这个问题是寻找无权图的最大团问题的推广 。
在第一章，介绍了最大团问题的有关定义和优化模型。
The main contents are organized as follows:In chapter 1, some definitions and optimization models about the maximum clique problem are introduced.
最大团问题是组合优化中的一个经典的NP -完全问题。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
提出了关于最大团问题的一种新思路基于平均度排序的局部枚举算法。
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 (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
最大团问题是一个经典的图论问题，其目标是找出给定的某个图的最大完全子图。
The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.
应用推荐