Almost optimal local graph clustering using evolving sets (Q3177772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6912611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost optimal local graph clustering using evolving sets |
scientific article; zbMATH DE number 6912611 |
Statements
Almost Optimal Local Graph Clustering Using Evolving Sets (English)
0 references
2 August 2018
0 references
Cheeger's inequality
0 references
local graph clustering
0 references
random walks
0 references
sparsest cut
0 references
0.917200207710266
0 references
0.8426350951194763
0 references
0.8399540185928345
0 references
0.8338965773582458
0 references
0.8285907506942749
0 references
