文件名称:graphpartition
介绍说明－－下载内容均来自于网络，请自行研究使用
MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report:
Joã o Hespanha. An efficient MATLAB Algorithm for Graph Partitioning. Technical Report, University of California, Oct. 2004. Available at http://www.ece.ucsb.edu/~hespanha/techrep.html.
This algorithm was extensively used in this paper:
C. Lim, S. Bohacek, J. Hespanha, K. Obraczka. Hierarchical Max-Flow Routing. In Proc. of the IEEE GLOBECOM, Nov. 2005.
Joã o Hespanha. An efficient MATLAB Algorithm for Graph Partitioning. Technical Report, University of California, Oct. 2004. Available at http://www.ece.ucsb.edu/~hespanha/techrep.html.
This algorithm was extensively used in this paper:
C. Lim, S. Bohacek, J. Hespanha, K. Obraczka. Hierarchical Max-Flow Routing. In Proc. of the IEEE GLOBECOM, Nov. 2005.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
graphpartition\demo_grPartition.m
..............\GPL.txt
..............\grPartition.m
..............\Mathworks
..............\mykmeans.m
..............\tr-ell-gp.pdf
..............\tr-ell-gp.tex
graphpartition