Description: 用matlab求解图论中最大截问题，带有例子，简洁可靠。-Using matlab to solve the biggest cut in graph theory problem, with examples, simple and reliable. Platform: |
Size: 1024 |
Author:枫 |
Hits:
Description: 一种 较新的聚类算法 Dominant-set 的代码，包括聚类算法的代码和测试代码。该算法最大特点 就是基于图理论的 ，相对于Normalized Cut,计算复杂度低很多，况且能自动决定类的个数 -A relatively new clustering algorithm Dominant-set the code, including the clustering algorithm code and test code. Most prominent feature of the algorithm is based on graph theory, and compared with the Normalized Cut, much lower computational complexity, decision Moreover automatically the number of categories Platform: |
Size: 3072 |
Author:曾祥林 |
Hits:
Description: C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版-C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates Platform: |
Size: 11264 |
Author:jz |
Hits:
Description: 基于图割的能量最小化演示文稿。本人整理的，进一步理解图割理论的知识-Based on graph cut energy minimization of the presentation. I am finishing, and further understanding of the theory of knowledge in cutting plan Platform: |
Size: 271360 |
Author:王锐 |
Hits:
Description: 这是基于图论的图像分割源代码，效果很好，欢迎下载.-This is based on graph theory image segmentation source code, works well, welcome to download. Platform: |
Size: 5120 |
Author:zwl |
Hits:
Description: 基于分水岭算法和图论的图像分割，所使用的方法为分水岭算法和Normalized Cut方法-Based on watershed algorithm and graph theory, image segmentation, the method used as a watershed algorithm and Normalized Cut method Platform: |
Size: 288768 |
Author:谷继红 |
Hits:
Description: 图论的标准应用解决边割集问题，模板输出最优边割集，图用邻接矩阵表示-The standard application of graph theory to solve the problem edge cut set, the optimal edge-cut set of template output, with adjacency matrix graph Platform: |
Size: 1024 |
Author:ccl |
Hits:
Description: 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms. Platform: |
Size: 508928 |
Author:珞珞 |
Hits:
Description: 对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 minimum cut shortest times short circuit, Prim minimum spanning tree algorithm, the shortest path. Not because of too many to enumerate. Platform: |
Size: 55296 |
Author:中士 |
Hits:
Description: 这个程序实现与Matlab的优化工具箱下，用于给图进行边着色。包含了很多图论的程序，如计算最大割集、连通度、最小覆盖边数等等……
-This program is implemented with Matlab Optimization Toolbox for graph edge coloring. Contains a lot of graph theory program, such as the calculation of the maximum cut sets, connectivity, minimal covering the number of edges, etc. ... Platform: |
Size: 28672 |
Author:Kansess |
Hits:
Description: GrTheory - Graph Theory Toolbox.
Functions:
grBase - find all bases of digraph
grCoBase - find all contrabases of digraph
grCoCycleBasis - find all independent cut-sets for a connected graph
grColEdge - solve the color problem for graph edges
grColVer - solve the color problem for graph vertexes
grComp - find all components of graph-GrTheory - Graph Theory Toolbox.
Functions:
grBase - find all bases of digraph
grCoBase - find all contrabases of digraph
grCoCycleBasis - find all independent cut-sets for a connected graph
grColEdge - solve the color problem for graph edges
grColVer - solve the color problem for graph vertexes
grComp - find all components of graph Platform: |
Size: 34816 |
Author:Mohsen |
Hits:
Description: 系统地综述了基于MRF的图像分割方法。介绍了基于MRF模型的图像分割理论框架,给出了当前MRF图像建模研究的热点问题。概括了基于MRF模型的图像分割算法,包括图割算法、归一化割算法、置信度传播算法等,指出了这些算法的发展方向-Summarized the image segmentation method based on MRF. Introduces the image segmentation based on MRF model theory framework, gives the hotspot issue of MRF image modeling study. Summarized the image segmentation algorithm based on MRF model, including the graph cut algorithm, the normalized cut algorithm, belief propagation algorithm, points out the development direction of these algorithms Platform: |
Size: 9686016 |
Author:草 |
Hits:
Description: 最大流 最小割 是图割理论的重要部分，能用于双目立体视觉的立体匹配当中。-Max-flow is the important part of graph-cut theory,it also used to the stereo matching. Platform: |
Size: 5120 |
Author:蓉 |
Hits:
Description: 图论的基本应用,包括寻找有向图的基，独立割集的连通图，最大联通子图等几乎所有图论的基本程序-The basic application of graph theory, including the search for a directed graph of the base, connected graph cut sets separate maximum Unicom subgraph of graph theory, almost all of the basic program Platform: |
Size: 30720 |
Author:Evan |
Hits:
Description: 资源说明：图论的基本应用,包括寻找有向图的基，独立割集的连通图，最大联通子图等几乎所有图论的基本程序-The basic application of graph theory, including the search for a directed graph of the base, connected graph cut sets separate maximum Unicom subgraph of graph theory, almost all of the basic program Platform: |
Size: 30796 |
Author:AlipayLogin_2088622929403865 |
Hits:
Search - cut graph theory