搜索资源列表
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.
zuixiaoquandingdianfugai
- 给定一个赋权无向图G=(V,E)，每个定点v∈U都有一个权值w(v)。如果U V，且对任意(u,v)∈E有u∈U或v∈U，就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。-Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on
ddfg
- 用ＭＡＴＬＡＢ写的顶点覆盖近似算法。 打开m文件自己看一下就好了，我也不费口舌了，只是这种近似算法结果很差-Vertex cover approximation algorithm
Matlab__dingdianfugai
- 属于图像处理的基本算法，用MATLAB实现了顶点覆盖的近似算法。-Belong to the basic algorithm for image processing using MATLAB realization of the vertex cover approximation algorithm.
VertCover
- 一个顶点覆盖近似算法,对开发GIS和网络方面的应用非常有用.-A vertex cover approximation algorithm, for developing the application of GIS and network very useful.
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
source
- Very good collection of c++ source code. Implementation of diffrents alghoritms in graph theory, such as floyd,fulkerson. dijkstra,warshall, binary tree,map coloring,vertex cover.
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
CHUONG4
- Finding a vertex cover of minimum cardinality is NP-hard
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