Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs (Q5232720): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963048056 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1710.01143 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:10, 20 April 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
