搜索资源列表
最大团问题2
- 定义一个类，调用构造函数，递归函数，输出函数-definition of a category, called Constructors, recursive function, output function
zuidatuan
- 解决最大团问题的好方法，喜欢的可以借鉴一下 -largest corporations to solve the easy way out, like can learn some lessons from
zuidatuan
- 回溯法最大团问题-Backtracking biggest problem Mission
最大团
- 回溯算法中的图的最大团问题-backtracking algorithms map of the biggest problems Mission
qkw_MaxClique
- //最大团问题的分支限界解法 //屈克文，2008.12.01-//The largest branch of the problem Mission Bound Solution// flexor Rudd, 2008.12.01
MCP
- 此程序为实现最大团问题,是C++语言源码-maximum 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.
clique
- 最大团问题 回溯法 分支限界法 绝对给力 -the largest group huisu fenzhixianjie
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.
max-set
- 最大团求解问题的各种算法和源代码介绍,可以解决类似的传感网络最大集合问题-Maximum group problem solving various algorithms and source code introduced a similar sensor networks can solve the biggest problem of the collection
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
fromgrouk
- 解决最大团问题的好方法,喜欢的可以借鉴一下,不错的-A good way to solve the problem of the largest group, can draw lessons from, like good
GREEDY MAX-IS
- 最大独立集的贪心算法简易实现，可以快速求取节点数量较少的最大独立集问题。(An approximated greedy algorithm for Maximum Independent Set Problem)
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