A pagerank-based heuristic algorithm for influence maximization in the social network

ZL Luo, WD Cai, YJ Li, D Peng - Recent Progress in Data Engineering and … - Springer
The influence maximization is the problem of how to find a small subset of nodes (seed
nodes) that could maximize the spread of influence in social network. However, it proved to …
被引用次数：32 相关文章

A PageRank-Based Heuristic Algorithm for Influence Maximization in the Social Network

ZL Luo, WD Cai, YJ Li, D Peng - Recent Progress in Data …, 2012 - books.google.com
The influence maximization is the problem of how to find a small subset of nodes (seed
nodes) that could maximize the spread of influence in social network. However, it proved to …

[引用][C] A PageRank-Based Heuristic Algorithm for Influence Maximization in the Social Network

ZL Luo, WD Cai, YJ Li, D Peng - Lecture Notes in Electrical Engineering, 2012 - cir.nii.ac.jp
A PageRank-Based Heuristic Algorithm for Influence Maximization in the Social Network | CiNii
Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 …

A PageRank-Based Heuristic Algorithm for Influence Maximization in the Social Network

ZL Luo, WD Cai, YJ Li, D Peng - Recent Progress in Data Engineering and … - Springer
The influence maximization is the problem of how to find a small subset of nodes (seed
nodes) that could maximize the spread of influence in social network. However, it proved to …