Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs
Author:
Affiliation:
1. International Institute of Information Technology, Hyderabad, India
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3392717.3392743
Reference32 articles.
1. Approximating Betweenness Centrality
2. A Mathematical Model for Group Structures
3. Approximating Betweenness Centrality in Large Evolving Networks
4. A faster algorithm for betweenness centrality*
5. Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs
Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Exact and Approximate Betweenness Centrality Computation for Temporal Graphs;Proceedings of the ACM Web Conference 2024;2024-05-13
2. Path Merging Based Betweenness Centrality Algorithm in Delay Tolerant Networks;IEEE Journal on Selected Areas in Communications;2023-10
3. Closeness Centrality on Uncertain Graphs;ACM Transactions on the Web;2023-07-11
4. Galliot: Path Merging Based Betweenness Centrality Algorithm on GPU;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17
5. Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3