Towards Efficient Shortest Path Counting on Billion-Scale Graphs
Author:
Affiliation:
1. Nanjing University of Science and Technology,Nanjing,China
2. East China Normal University
3. The University of New South Wales,Sydney,Australia
4. Shanghai Jiaotong University,Shanghai,China
5. CSIRO,Data61,Hobart,Australia
Funder
Engineering Laboratory
Publisher
IEEE
Link
http://xplorestaging.ieee.org/ielx7/10184508/10184509/10184857.pdf?arnumber=10184857
Reference64 articles.
1. Hierarchical Hub Labelings for Shortest Paths
2. Efficient Graphlet Counting for Large Networks
3. Fast exact shortest-path distance queries on large networks by pruned landmark labeling
4. Complexity of Finding Embeddings in a k-Tree
5. Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs;Proceedings of the VLDB Endowment;2024-07
2. The Future of Graph Analytics;Companion of the 2024 International Conference on Management of Data;2024-06-09
3. Scalable Distance Labeling Maintenance and Construction for Dynamic Small-World Networks;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
4. Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
5. Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks;Data Science and Engineering;2023-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3