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

Path Merging Based Betweenness Centrality Algorithm in Delay Tolerant Networks

  • Published:2023-10 Issue:10 Volume:41 Page:3133-3145
  • ISSN:0733-8716
  • Container-title:IEEE Journal on Selected Areas in Communications
  • language:
  • Short-container-title:IEEE J. Select. Areas Commun.

Author:

Zheng Zhigao1,Du Bo1ORCID,Zhao Chen1,Xie Peichen1

Affiliation:

1. School of Computer Science, National Engineering Research Center for Multimedia Software, Institute of Artificial Intelligence, Hubei Key Laboratory of Multimedia and Network Communication Engineering, and the Hubei Luojia Laboratory, Wuhan University, Wuhan, China

Funder

National Natural Science Foundation of China

Fundamental Research Funds for the Central Universities

Project funded by China Postdoctoral Science Foundation

Natural Science Foundation of Hubei Province

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Computer Networks and Communications

Reference61 articles.

1. A faster algorithm for betweenness centrality*

2. Evaluating centrality metrics in real-world networks on GPU;anuroop;Proc 16th Int Conf High Perform Comput,2009

3. Graph manipulations for fast centrality computation;sar?yüce;ACM Trans Knowl Discovery Data,2017

4. Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs

5. AutoMine

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3