论文信息 - An Efficient MATLAB Algorithm for Graph Partitioning

An Efficient MATLAB Algorithm for Graph Partitioning

This report describes a graph partitioning algorithm based on spectral factorization that can be implemented very ecien tly with just a hand full of MATLAB commands. The algorithm is closely related to the one proposed by Phillips and Kokotovi c [4] for state-aggregation in Markov chains. The appendix contains a MATLAB script that implements the algorithm. This algorithm is available online at [3].

P. Hespanha | P. Hespanha

[1] Alan M. Frieze,et al. Improved approximation algorithms for MAXk-CUT and MAX BISECTION , 1995, Algorithmica.

[2] Maxim Sviridenko,et al. An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts , 1999 .

[3] Joydeep Ghosh,et al. Scalable, Balanced Model-based Clustering , 2003, SDM.