Multi-level spectral graph partitioning method

Versione 1.0.0.2 (26,3 KB) da Muhammed Talu
a new method for multi-level and balanced division of non-directional graphs (MSGP) is introduced.
0.0
(0)
235 download
Aggiornato 3 mag 2019

Visualizza la licenza

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.

Cita come

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.

Visualizza più stili
Compatibilità della release di MATLAB
Creato con R2017a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Graph and Network Algorithms in Help Center e MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

MSGP

Versione Pubblicato Note della release
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.