메뉴 건너뛰기




Volumn 157 LNEE, Issue VOL. 2, 2012, Pages 485-490

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

Author keywords

[No Author keywords available]

Indexed keywords

GREEDY ALGORITHMS; INFLUENCE MAXIMIZATIONS; NP-HARD; POWER-LAW; SEARCH TIME; SOCIAL NETWORKS;

EID: 84865620133     PISSN: 18761100     EISSN: 18761119     Source Type: Book Series    
DOI: 10.1007/978-3-642-28798-5_65     Document Type: Conference Paper
Times cited : (25)

References (13)
  • 1
    • 79959906247 scopus 로고    scopus 로고
    • Social networks blogs now 4th most popular online activity
    • Nielsen Online Report: Social networks blogs now 4th most popular online activity (2009)
    • (2009) Nielsen Online Report
  • 2
    • 0010087219 scopus 로고    scopus 로고
    • Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
    • Goldenberg, J., Libai, B., Muller, E.: Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth. Marketing Letters 12(3), 211-223 (2001)
    • (2001) Marketing Letters , vol.12 , Issue.3 , pp. 211-223
    • Goldenberg, J.1    Libai, B.2    Muller, E.3
  • 7
    • 0000095809 scopus 로고
    • An analysis of the approximations for maximizing submodular set functions
    • Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions. Mathematical Programming 14, 265-294 (1978)
    • (1978) Mathematical Programming , vol.14 , pp. 265-294
    • Nemhauser, G.1    Wolsey, L.2    Fisher, M.3
  • 9
    • 0038718854 scopus 로고    scopus 로고
    • The Structure and Function of Complex Networks
    • Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167-256 (2003)
    • (2003) SIAM Review , vol.45 , Issue.2 , pp. 167-256
    • Newman, M.E.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.