Efficient modularity density heuristics for large graphs (Q1751717)
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: Efficient modularity density heuristics for large graphs |
scientific article; zbMATH DE number 6873548
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient modularity density heuristics for large graphs |
scientific article; zbMATH DE number 6873548 |
Statements
Efficient modularity density heuristics for large graphs (English)
0 references
25 May 2018
0 references
heuristics
0 references
clustering
0 references
modularity density maximization
0 references
large graphs
0 references
