搜索资源列表
np
- 顶点覆盖问题的NP完全证明和顶点覆盖优化问题的近似算法-vertex cover problem NP-complete certification and vertex cover the approximate optimization algorithm
matlab_tools
- MALAB程序，包括顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,最小生成树Prim算法,最短路径等-MALAB procedures, including vertex cover approximation algorithm, Hamilton circuit, painting isotherms, simulated annealing applications, to generate full-rank matrix, Prim minimum spann
NPVertexCover
- NP问题的顶点覆盖问题的近似算法的Vc++实现-NP problem vertex cover problem approximation algorithm Vc++ Achieve
vertex_cover_approximation_algorithm
- 专为建模学生提供的算法：顶点覆盖近似算法-Designed to provide students with modeling algorithms: vertex cover approximation algorithm
classic
- 经典的matlab算法代码，包括顶点覆盖近似算法，哈密尔顿回路，最短路和次短路，最短路径等等。-Classical algorithm matlab code, including the vertex cover approximation algorithm, Hamilton circuit, the most short-circuit and sub-circuit, the shortest path and so on.
ddfg
- 用ＭＡＴＬＡＢ写的顶点覆盖近似算法。 打开m文件自己看一下就好了，我也不费口舌了，只是这种近似算法结果很差-Vertex cover approximation algorithm
Vertex_Cover_Code
- This project discusses different techniques and algorithms used to solve the parameterized Vertex Cover problem. A vertex cover of a graph G(V,E) is a subset of vertices V such that for every edge (u, v) ⊆ E, at least one of the vertices u or v
3041
- poj 第3041_Asteroids题，最小顶点覆盖 网络流 最小割 邻接表-poj first 3041_Asteroids problem, minimum vertex cover network flow minimum cut adjacency list
ddfg
- 输入关联矩阵F及节点个数n得到近似覆盖顶点，只是这种近似算法结果很差-Input correlation matrix F and the node n be the number of vertex cover approximation, only the results of such poor approximation algorithm
Minimum-weight-vertexCoverProblem
- 最小权顶点覆盖问题，C++完成，模块化实现函数功能-Minimum weight vertex cover problem, C++ to complete, modular feature implementation function
pku3715-Blue-and-Red
- Blue and Red 图论相关问题，标准最小点覆盖集 最小点覆盖 具体集合 -Blue and Red graph related problems, the standard set of minimum vertex cover specific set of minimum vertex cover
ddfg
- 顶点覆盖近似算法 matlab编写的，近似效果还可以-Vertex cover approximation algorithm written in matlab, similar effect can also be
suffixArray_vertexCover
- Implementation of Suffix Array and Vertex Cover algorithms
cc
- 近似顶点覆盖,算法 设计课 程作业，能运行成功-Approximate vertex cover algorithm design course work, be able to run successfully
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
Matlab-algorithm-important
- 本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等，带有源程序和中文说明文档，此文件夹中的文件，如需被利用，则要直接放至work目录下。-The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and mini
ddfg
- 顶点覆盖近似算法 matlab编写的，近似效果还可以-Vertex cover approximation algorithm matlab, the effect can be approximated
dingdianfugai
- 顶点覆盖的近似算法，含有matlab编程的源码，可直接运行-Vertex cover approximation algorithm containing matlab program source code, can be directly run
vertex_cover
- 内容为顶点覆盖问题的程序设计： 给定一个 n 个点 m 条边(n≤ 100,m≤5000)的无向图 G，问是否存在一个不超过 k(𝑘 ≤20)个点的点集 S，使得 G 中每条边都至少有一个点被覆盖。该实现效率很高，较大的测试用例也可以在15ms内计算出。-vertex cover problem.
About-the-MATLAB-programs
- 关于在MATLAB上的递推关系式，顶点覆盖近似算法，方程求跟，哈密尔顿回路，花等温线的五个程序-About the MATLAB recursive relationship, vertex cover approximation algorithm, with demand equation, Hamilton loop, flower isotherms of five programs