Almost Optimal Local Graph Clustering Using Evolving Sets
DOI10.1145/2856030zbMATH Open1426.05158OpenAlexW2346393863MaRDI QIDQ3177772FDOQ3177772
Luca Trevisan, Shayan Oveis Gharan, Yuval Peres, Reid Andersen
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2856030
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks on graphs (05C81)
Cited In (5)
- Approximate and exact solutions of intertwining equations through random spanning forests
- Title not available (Why is that?)
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Title not available (Why is that?)
- Mean field analysis of personalized PageRank with implications for local graph clustering
This page was built for publication: Almost Optimal Local Graph Clustering Using Evolving Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177772)
