搜索资源列表
MCP
- 此程序为实现最大团问题,是C++语言源码-maximum clique
k_clique
- 基于社交网络的k-clique算法，完成社团划分-Based on the social network k-clique algorithm
macego10
- C program with Clique algorithm windows implementation
zuidatuan-yanjiu
- 最大团问题的 分支限界法与回溯法比较Python写成。-Backtracking branch and bound method and comparison of the maximum clique problem written in Python.
wheats-master
- 基于网格的聚类算法，经典的clique算法的java实现，(Grid-based clustering algorithm, the classic clique algorithm java implementation,)
MaxClique.java
- 回溯法求解最大团问题，时间复杂度为O(n*2^n)。(The backtracking method is used to solve the maximum clique problem with a time complexity of O (n*2^n).)
ISP
- 独立集是指图 G 中两两互不相邻的顶点构成的集合。任意有关图中团的性质都能很自然的转述成独立集的性质。一般而言，寻找图的最大团是 NP 困难的，从而寻找图的最大独立集也是 NP 困难的。用模拟退火算法找出图的最大独立集。(Independent set is a set of vertices in graph G that are not adjacent to each other. The properties of cliques in any graph can be naturall