Efficient single-source shortest path and distance queries on large graphs-Reference-Cited by-同舟云学术

Efficient single-source shortest path and distance queries on large graphs

Published:2013-08-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
language:
Short-container-title:

Author:

Zhu Andy Diwen¹,Xiao Xiaokui¹,Wang Sibo²,Lin Wenqing³

Affiliation:

1. Nanyang Technological Univeristy, Singapore, Singapore

2. Nanyang Technological Univesity, Singapore, Singapore

3. Nanyang Technological University, Singapore, Singapore

Publisher

ACM

Link

Reference27 articles.

1. http://www.dis.uniroma1.it/challenge9/download.shtml. http://www.dis.uniroma1.it/challenge9/download.shtml.

2. http://vmlion25.deri.ie/. http://vmlion25.deri.ie/.

3. http://barcelona.research.yahoo.net/webspam/datasets/uk2007/links/. http://barcelona.research.yahoo.net/webspam/datasets/uk2007/links/.

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

4. All in One: Multi-Task Prompting for Graph Neural Networks;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04

5. Towards Efficient Shortest Path Counting on Billion-Scale Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04