Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source

Published:2024-08 Issue: Volume:299 Page:105171
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Deligkas Argyrios,Döring Michelle,Eiben Eduard,Goldsmith Tiger-Lily,Skretas George^ORCID

Publisher

Elsevier BV

Reference41 articles.

1. On influential node discovery in dynamic social networks;Aggarwal,2012

2. Competitive facility location: the Voronoi game;Ahn;Theor. Comput. Sci.,2004

3. A note on competitive diffusion through social networks;Alon;Inf. Process. Lett.,2010

4. Debunking the myths of influence maximization: an in-depth benchmarking study;Arora,2017

5. Efficient computation of optimal temporal walks under waiting-time constraints;Bentert;Appl. Netw. Sci.,2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP