Influence maximization: Near-optimal time complexity meets practical efficiency

Y Tang, X Xiao, Y Shi - Proceedings of the 2014 ACM SIGMOD …, 2014 - dl.acm.org
Given a social network G and a constant k, the influence maximization problem asks for k
nodes in G that (directly and indirectly) influence the largest number of nodes under a pre …
被引用次数：937 相关文章

Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency

Y Tang, X Xiao, Y Shi - arXiv e-prints, 2014 - ui.adsabs.harvard.edu
Given a social network G and a constant k, the influence maximization problem asks for k
nodes in G that (directly and indirectly) influence the largest number of nodes under a pre …

Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency

Y Tang, X Xiao, Y Shi - arXiv preprint arXiv:1404.0900, 2014 - arxiv.org
Given a social network G and a constant k, the influence maximization problem asks for k
nodes in G that (directly and indirectly) influence the largest number of nodes under a pre …
[PDF] researchgate.net

[PDF][PDF] Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency

Y Tang, X Xiao, Y Shi - arXiv preprint arXiv:1404.0900, 2014 - researchgate.net
Given a social network G and a constant k, the influence maximization problem asks for k
nodes in G that (directly and indirectly) influence the largest number of nodes under a pre …

[引用][C] Influence maximization

Y Tang, X Xiao, Y Shi - Proceedings of the 2014 ACM SIGMOD …, 2014 - cir.nii.ac.jp
Influence maximization | CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ]
詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本をさがす 日本の博士論文を …
[PDF] psu.edu

[PDF][PDF] Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency

Y Tang, X Xiao, Y Shi - arXiv preprint arXiv:1404.0900, 2014 - Citeseer
Given a social network G and a constant k, the influence maximization problem asks for k
nodes in G that (directly and indirectly) influence the largest number of nodes under a pre …