搜索资源列表
maximalCliques
- 求最大团的算法，Bron-Kerbosch 算法计算图的最大全连通分量(团clique)，matlab实现-Seeking maximum clique algorithm, Bron-Kerbosch algorithm to calculate the maximum fully connected graph component (group clique), matlab achieve
Data-Mining-Concepts-and-Techniques
- 数据挖掘：KDD 过程，不同类型数据的距离度量方式，小波 PCA 属性子集选择-KMean KModoid BIRCH CHEMELEON DBSCAN OPTICE STING CLIQUE EM SCAN
connected_clique_test
- Connected Clique Problem (Graph Alogorithm) Implementation in C
zuidatuan-yanjiu
- 最大团问题的 分支限界法与回溯法比较Python写成。-Backtracking branch and bound method and comparison of the maximum clique problem written in Python.
weixing
- 针对传统卫星广播重传策略信道占用率较高、重传次数较多的问题，高链路丢包率下的基于网络编码的广播重传策略不能达到重传性能最优的问题，以及最大团策略计算开销较大的问题，提出了一种改进的基于网络编码的广播重传策略。理论分析及仿真实验证明了改进的基于网络编码的广播重传策略较好地解决了以上重传策略的问题，保证了卫星通信中的组播数据的快速、可靠的发布。-Aiming at the problems of traditional satellite
MCP
- 用集合和游标法求解最大团问题,在sql server 2008上运行成功。含项目报告-Solving the maximum clique problem with the select and cursor
exp5
- 福建师范大学 算法设计技巧与分析实验 回溯法解决最大团问题-Algorithm design techniques and analysis of experiments Backtracking maximum clique problem solving
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
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)