I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs

DOI10.1016/j.ins.2017.03.017zbMath1431.91311MaRDI QIDQ2293164

XiaoHong Guan, Don Towsley, John C. S. Lui, Junzhou Zhao, Pinghui Wang

Publication date: 7 February 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.03.017

zbMATH Keywords

greedy algorithm; submodularity; online social network; disk-resident graph; group centrality

Mathematics Subject Classification ID

91D30: Social networks; opinion dynamics

68W25: Approximation algorithms

91-05: Experimental work for problems pertaining to game theory, economics, and finance

Uses Software

• HyperLogLog
• ANF
• WebGraph
• GraphChi