Publisher
Springer Nature Switzerland
Reference24 articles.
1. Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD 2013, pp. 349–360 (2013)
2. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003)
3. Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: SIGMOD 2010, pp. 123–134 (2010)
4. Kunegis, J.: KONECT: the Koblenz network collection. In: WWW 2013, pp. 1343–1350 (2013)
5. Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Variable-Length Path Query Evaluation Based on Worst-Case Optimal Joins;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13