Partitioning into Expanders
From MaRDI portal
Publication:5384055
DOI10.1137/1.9781611973402.93zbMath1423.05182arXiv1309.3223OpenAlexW2950930877MaRDI QIDQ5384055
Shayan Oveis Gharan, Luca Trevisan
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3223
Analysis of algorithms (68W40) 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 (10)
Spectral concentration and greedy \(k\)-clustering ⋮ Approximately counting independent sets in bipartite graphs via graph containers ⋮ Unnamed Item ⋮ Partitioning Well-Clustered Graphs: Spectral Clustering Works! ⋮ Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks ⋮ Bipartite communities via spectral partitioning ⋮ Remarks on partitions into expanders ⋮ Convex programming based spectral clustering ⋮ Social pressure in opinion dynamics ⋮ Distributed detection of clusters of arbitrary size
This page was built for publication: Partitioning into Expanders
