Computing Top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs (Q5232547)
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: Computing Top-k Closeness Centrality Faster in Unweighted Graphs |
scientific article; zbMATH DE number 7104458
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs |
scientific article; zbMATH DE number 7104458 |
Statements
Computing Top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs (English)
0 references
12 September 2019
0 references
