I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
From MaRDI portal
Publication:2293164
DOI10.1016/j.ins.2017.03.017zbMath1431.91311OpenAlexW2592759774MaRDI QIDQ2293164
Don Towsley, Pinghui Wang, Junzhou Zhao, John C. S. Lui, XiaoHong Guan
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
Social networks; opinion dynamics (91D30) Approximation algorithms (68W25) Experimental work for problems pertaining to game theory, economics, and finance (91-05)
Related Items
Optimizing node discovery on networks: problem definitions, fast algorithms, and observations ⋮ Detecting a most closeness-central clique in complex networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quick Detection of Nodes with Large Degrees
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Ranking of Closeness Centrality for Large-Scale Social Networks
- An analysis of approximations for maximizing submodular set functions—I
- The centrality of groups and classes
- Axioms for Centrality
- Tractability
- Submodular Maximization with Cardinality Constraints
- Algorithms - ESA 2003