On a connection between small set expansions and modularity clustering
DOI10.1016/J.IPL.2014.02.004zbMATH Open1284.68453arXiv1111.3048OpenAlexW2083674792MaRDI QIDQ2446591FDOQ2446591
Authors: Devendra Desai, Bhaskar Dasgupta
Publication date: 17 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3048
Recommendations
- Graph expansion and the unique games conjecture
- Subexponential algorithms for unique games and related problems
- Min-Max Graph Partitioning and Small Set Expansion
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis
- Approximation algorithms for hypergraph small set expansion and small set vertex expansion
Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Random walks on graphs (05C81) Network design and communication in computer systems (68M10)
Cites Work
Cited In (2)
This page was built for publication: On a connection between small set expansions and modularity clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446591)