Multi-level spectral graph partitioning method
a new method for multi-level and balanced division of non-directional graphs (MSGP) is introduced.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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.
General Information
- Version 1.0.0.2 (26.3 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
