Multi-level spectral graph partitioning method

Version 1.0.0.2 (26.3 KB) by Muhammed Talu
a new method for multi-level and balanced division of non-directional graphs (MSGP) is introduced.
0.0
(0)
236 Downloads
Updated 3 May 2019

View License

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.

Cite As

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.

View more styles
MATLAB Release Compatibility
Created with R2017a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

MSGP

Version Published Release Notes
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.