A local algorithm for finding dense subgraphs (Q2930342)
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 algorithm for finding dense subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local algorithm for finding dense subgraphs |
scientific article |
Statements
A local algorithm for finding dense subgraphs (English)
0 references
18 November 2014
0 references
dense subgraphs
0 references
local algorithms
0 references
spectral graph theory
0 references
0.877054750919342
0 references
0.8045456409454346
0 references
0.7999647855758667
0 references
0.7997694611549377
0 references
0.7871999144554138
0 references
