搜索资源列表
mcqd
- Maximum Clique Algorithm
123
- 免疫算法解决最大团问题；此文件为源代码，经过多次验证可行。将代码输入matlab就可以运行。-Immune algorithm to solve the maximum clique problem source code of this file, feasible after several validation. Matlab code input can run.
MCP
- 最大团问题，matlab程序，无程序说明 -Maximum clique problem
k_clique
- CLIQUE聚类算法 CLIQUE是高维数据空间中基于网格和密度的聚类方法。-k-clique algorithm as defined in the paper "Uncovering the overlapping community structure of complex networks in nature and society"- G. Palla, I. Derényi, I. Farkas, and T. Vicsek- Nature 435, 814–818 (2005)
maximalCliques
- 求最大团的算法，Bron-Kerbosch 算法计算图的最大全连通分量(团clique)，matlab实现-Seeking maximum clique algorithm, Bron-Kerbosch algorithm to calculate the maximum fully connected graph component (group clique), matlab achieve
connected_clique_test
- Connected Clique Problem (Graph Alogorithm) Implementation in C
k_clique
- k_clique is matlab code to clique the tree problem
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
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.
分析zachary的派系过滤和谱平均算法
- 两个用来分析zachary网络的简易方法，一种是谱平均算法，一种是派系过滤算法(Two simple methods for analyzing Zachary networks, one is spectral averaging algorithm, and the other is clique filtering algorithm)
m文件
- 我国矿产资源的总体特征：单一矿种矿床较少，多为多种有用组份（组成成分）伴生于同一矿体中（可称为伴生矿床），或两种以上的矿种共生在同一地质建造中（可称为共生矿床）；同一矿体或同一地区的矿床往往前后经历多次成矿的地质作用，增加了综(There anre two characteristics of the mineral resources in China. There is little mines with single resource, while most of mines with m