Multi-level spectral graph partitioning method

a new method for multi-level and balanced division of non-directional graphs (MSGP) is introduced.
235 descargas
Actualizado 3 may 2019

Ver licencia

A new method MSGP which enables multilevel and balanced partition
of regular and irregular graphs. The method has a spectral approximation and
shows that the eigenvectors of Laplacian of a graph have the multi-level and balanced
partitioning knowledge. Inspired by the Haar wavelets, MSGP reveals this hidden
knowledge in eigenvectors by using binary heap trees in the implementation stage. The
experimental works clearly demonstrate the superiority of MSGP over the seven existing
methods in terms of the correctness and performance.

Citar como

Talu, Muhammed Fatih. “Multi-Level Spectral Graph Partitioning Method.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2017, no. 9, IOP Publishing, Sept. 2017, p. 093406, doi:10.1088/1742-5468/aa85ba.

Ver más estilos
Compatibilidad con la versión de MATLAB
Se creó con R2017a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Graph and Network Algorithms en Help Center y MATLAB Answers.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Versión Publicado Notas de la versión
1.0.0.2

Change the name of running m file

1.0.0.1

Add simple script to see Splitting Results

1.0.0.0

Figure has been updated.