SIAM Journal on Computing· 2013Q1
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- 309citations
- Q1SCImago
- 2013year
Short summary
A new local clustering algorithm finds a dense subgraph near a given vertex in nearly linear time relative to the cluster size, enabling a nearly linear time graph partitioning algorithm for approximate sparsest cuts.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Geometry and Topology
Geometry and TopologyMathematics