搜索资源列表
CLIQUEAlgorithm
- CLIQUE Algorithm相关论文，报告及相关文献资料-CLIQUE Algorithm relevant papers, reports and related documents
MCP
- 回溯法解决对大团问题。从txt文本中读取矩阵信息，再通过回溯法求解最大团。-Backtracking to solve the Maximum Clique Problem. Read matrix information the text, and then solve the MCP.
k_clique
- k_clique is matlab code to clique the tree problem
SQLforClique.ZIP
- 用数据库SQL方式，计算图论上的最大完全子图的方式。之所以写这个，是因为假如矩阵太大，常规的数组方式会溢出，所以根据原理，改写了一个数据库SQL方式实现的代码。-a method to get clique by mysql s data type
CliqueB
- 基于派系方法的社团结构划分算法，自己实现的，C++代码源程序。-A method of community structure based clique.
k_clique
- [X,Y,Z] = k_clique(k,A) Inputs: k - clique size A - adjacency matrix Outputs: X - detected communities Y - all cliques (i.e. complete subgraphs that are not parts of larger complete subgraphs) Z - k-clique matrix-k-clique alg
pso-code
- There is here a PSO implementation for Maximum clique problem
GMCP_Tracker_Code
- 利用GCMP实现多目标跟踪，即Generalized Minimum Clique Graphs，可运行无误，效果很好- Global Multi-object Tracking Using Generalized Minimum Clique Graphs,
MWCP(TS)
- 采用禁忌搜索算法解决最大权值团问题，包含最大独立集于最大权值团之间的转换问题。-Tabu search algorithm using the maximum weight clique problem solving, contains the largest independent set in the maximum weight conversion problems between the groups.
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
Chordality
- calculate minimum independent set and maximum clique number of a chordal graph
max
- 最大团问题 附有文档和代码-Maximum clique problem, C language of an algorithm, we usually encounter in the course of the algorithm-max clique
分析zachary的派系过滤和谱平均算法
- 两个用来分析zachary网络的简易方法，一种是谱平均算法，一种是派系过滤算法(Two simple methods for analyzing Zachary networks, one is spectral averaging algorithm, and the other is clique filtering algorithm)
MaximumCLique.cpp
- find maximum clique in a graph
m文件
- 我国矿产资源的总体特征：单一矿种矿床较少，多为多种有用组份（组成成分）伴生于同一矿体中（可称为伴生矿床），或两种以上的矿种共生在同一地质建造中（可称为共生矿床）；同一矿体或同一地区的矿床往往前后经历多次成矿的地质作用，增加了综(There anre two characteristics of the mineral resources in China. There is little mines with single resource, while most of mines with m
CliquePercolationMethod-master
- 派系过滤算法（CPM）是一个寻找重叠的社区网络(Clique Percolation Method (CPM) is a gephi plugin for finding overlapping communities)
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