Author:
Chan Edward P. F.,Lim Heechul
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems
Reference18 articles.
1. Agrawal, R., Jagadish, H.V.: Algorithms for searching massive graphs. IEEE Trans. on Knowl. Data Eng. 6(2), 225–238 (1994)
2. Bancilhon, F., Ramakrishnan, R.: An Amateur's introduction to recursive query processing strategies. In: Proceedings of Sigmod, pp.16–52 (1996)
3. Chan, E.P.F., Zhang, N.: Finding shortest paths in large network systems. In: Proceedings of the 9th ACM International Workshop on Advances in Geographic Information Systems. (ACM-GIS 2001). pp.160–166 Atlanta, Georgia (2001)
4. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest path algorithms: theory and experimental evaluation. Mathematical Programming. 73, 129–174 (1996)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press (1990)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Path Querying in Graph Databases: A Systematic Mapping Study;IEEE Access;2024
2. Dynamic Load Distribution of Shortest-Path Finding in Client-Server Public Transit System;2023 International Conference on Modeling & E-Information Research, Artificial Learning and Digital Applications (ICMERALDA);2023-11-24
3. SHAREK*: A Scalable Matching Method for Dynamic Ride Sharing;GeoInformatica;2020-06-02
4. Boosting the Exploration of Huge Dynamic Graphs;Sampling Techniques for Supervised or Unsupervised Tasks;2019-10-27
5. Computing a Near-Maximum Independent Set in Dynamic Graphs;2019 IEEE 35th International Conference on Data Engineering (ICDE);2019-04