I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q341397 |
||
| Property / author | |||
| Property / author: XiaoHong Guan / rank | |||
Revision as of 17:51, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs |
scientific article |
Statements
I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (English)
0 references
7 February 2020
0 references
online social network
0 references
group centrality
0 references
disk-resident graph
0 references
submodularity
0 references
greedy algorithm
0 references
