I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ANF / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: HyperLogLog / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: WebGraph / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GraphChi / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ins.2017.03.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2592759774 / rank | |||
Normal rank | |||
Latest revision as of 22:02, 19 March 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
