Detecting maximum k-durable structures on temporal graphs-Reference-Cited by-全球学者库

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

Detecting maximum k-durable structures on temporal graphs

Published:2023-07 Issue: Volume:271 Page:110561
ISSN:0950-7051
Container-title:Knowledge-Based Systems
language:en
Short-container-title:Knowledge-Based Systems

Author:

Li Faming^ORCID,Zou Zhaonian,Liu Xianmin,Li Jianzhong,Yang Xiaochun,Wang Bin

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Management Information Systems,Software

Reference38 articles.

1. Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, Qiangqiang Dai, Persistent Community Search in Temporal Networks, in: ICDE, 2018, pp. 797–808, http://dx.doi.org/10.1109/ICDE.2018.00077.

2. Durable subgraph matching on temporal graphs;Li;IEEE Trans. Knowl. Data Eng.,2022

3. David Kempe, Jon M. Kleinberg, Éva Tardos, Maximizing the Spread of Influence through a Social Network, in: KDD, 2003, pp. 137–146, http://dx.doi.org/10.1145/956750.956769.

4. Rohit Kumar, Toon Calders, Information Propagation in Interaction Networks, in: EDBT, 2017, pp. 270–281, http://dx.doi.org/10.5441/002/edbt.2017.25.

5. Andreas Züfle, Matthias Renz, Tobias Emrich, Maximilian Franzke, Pattern Search in Temporal Social Networks, in: EDBT, 2018, pp. 289–300, http://dx.doi.org/10.5441/002/edbt.2018.26.

全球学者库

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP