搜索资源列表
enclus
- Entropy-based CLIQUE算法改进-entropy-based algorithm to improve CLIQUE
clique
- This the clique algorithm to find the clique on grids-This is the clique algorithm to find the clique on grids
MCP
- 此程序为实现最大团问题,是C++语言源码-maximum clique
ISCLIQUE
- 计算independent set和clique-compute maximal independent set and clique
TheMaxClique
- 算法实习，回溯法解最大团问题，MFC做的界面。-Algorithm practice, backtracking solve the maximum clique problem, MFC to do the interface.
zuidatuan
- 最大团问题的指导论文，内容丰富，有很大的指导启发意义。-Maximum clique problem of guidance papers, content-rich, a great guide instructive.
Nhopfielde
- 神经网络课程中的一个大作业, 使用hopfield网络络解决极大团问题的源码及实验报告，已通过测试。 -Neural network courses in a big job, use hopfield network network to solve the maximal clique problem code and experimental reports, has been tested.
clique
- 最大团问题 回溯法 分支限界法 绝对给力 -the largest group huisu fenzhixianjie
01
- 此文件为源代码，经过多次验证可行。将代码输入lingo就可以运行-Immune algorithm to solve the maximum clique problem source code of this file, feasible after several validation. Matlab code input can run.
Code_McCaffrey_TestRun1111
- clique clustering algorithm dataming baodt update
k_clique
- 基于社交网络的k-clique算法，完成社团划分-Based on the social network k-clique algorithm
macego10
- C program with Clique algorithm windows implementation
zuidatuan
- 最大团问题的指导论文，内容丰富，有很大的指导启发意义。-Maximum clique problem of guidance papers, content-rich, a great guide instructive.
zuidatuan-yanjiu
- 最大团问题的 分支限界法与回溯法比较Python写成。-Backtracking branch and bound method and comparison of the maximum clique problem written in Python.
bigteam
- 最大团问题，c语言编写的一个算法，大家平时都会遇到的尤其是在算法分析这门课中-Maximum clique problem, C language of an algorithm, we usually encounter in the course of the algorithm, especially in the course of the
max
- 最大团问题 附有文档和代码-Maximum clique problem, C language of an algorithm, we usually encounter in the course of the algorithm-max clique
MaximumCLique.cpp
- find maximum clique in a graph
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