A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning (Q2839169)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning |
scientific article; zbMATH DE number 6184144
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning |
scientific article; zbMATH DE number 6184144 |
Statements
4 July 2013
0 references
graph clustering
0 references
graph partitioning
0 references
local algorithms
0 references
sparsest cut
0 references
approximation algorithms
0 references
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning (English)
0 references
