Flow-Based Algorithms for Local Graph Clustering

DOI10.1137/1.9781611973402.94zbMath1422.68311arXiv1307.2855OpenAlexW1898392233MaRDI QIDQ5384056

Zeyuan Allen Zhu, Lorenzo Orecchia

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/1307.2855

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (9)

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Spectral concentration and greedy \(k\)-clustering ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Variational perspective on local graph clustering ⋮ Local computation algorithms for graphs of non-constant degrees ⋮ Local Flow Partitioning for Faster Edge Connectivity ⋮ Local algorithms for sparse spanning graphs ⋮ Unnamed Item ⋮ Compressive Sensing for Cut Improvement and Local Clustering

This page was built for publication: Flow-Based Algorithms for Local Graph Clustering