Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs (Q5232720): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:33, 8 February 2024
scientific article; zbMATH DE number 7104613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs |
scientific article; zbMATH DE number 7104613 |
Statements
Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs (English)
0 references
12 September 2019
0 references
