Fast graph centrality computation via sampling: a case study of influence maximisation over OSNs.
Rui WangMin LvZhiyong WuYongkun LiYinlong XuPublished in: Int. J. High Perform. Comput. Netw. (2019)
Keyphrases
- social networks
- online social networks
- betweenness centrality
- information propagation
- social graphs
- social network analysis
- graph structure
- graph theory
- random walk
- case study
- graph mining
- viral marketing
- graph model
- graph data
- graph connectivity
- random sampling
- weighted graph
- connected components
- sampling algorithm
- centrality measures
- subgraph isomorphism
- social influence
- graph partitioning
- overlapping communities
- frequent subgraph mining