Spectral partitioning with blends of eigenvectors

DOI10.1093/comnet/cnw033zbMath1462.05220arXiv1510.04658OpenAlexW2963854703MaRDI QIDQ4985066

David A. Bader, James P. Fairbanks, Geoffrey Sanders

Publication date: 22 April 2021

Published in: Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.04658

zbMATH Keywords

eigenvalueseigenfunctionsiterative methodsdata analysisgraph partitioningdata miningapproximation algorithmscommunity detectionLaplace equationspartitioning algorithms

Mathematics Subject Classification ID

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) Data structures (68P05) Approximation algorithms (68W25)

Related Items (1)

A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph

This page was built for publication: Spectral partitioning with blends of eigenvectors