First-principles multiway spectral partitioning of graphs
From MaRDI portal
Publication:4689342
DOI10.1093/comnet/cnt021zbMath1397.05142arXiv1209.5969OpenAlexW2052639209MaRDI QIDQ4689342
Maria A. Riolo, M. E. J. Newman
Publication date: 16 October 2018
Published in: Journal of Complex Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5969
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Underestimated cost of targeted attacks on complex networks, Spectral clustering methods for multiplex networks, An algorithm J-SC of detecting communities in complex networks, Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm, A spectral method to detect community structure based on distance modularity matrix, Community Detection in Networks via Nonlinear Modularity Eigenvectors, Optimization via low-rank approximation for community detection in networks
