Author:
Edelkamp Stefan,Jabbar Shahid,Schrödl Stefan
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lecture Notes in Computer Science;A. Aggarwal,1987
2. Lecture Notes in Computer Science;L. Arge,1993
3. Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamasia, R., Vengroff, D.E., Vitter, J.S.: External memory graph algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 139–149 (1995)
4. Dial, R.B.: Shortest-path forest with topological ordering. Communication of the ACM 12(11), 632–633 (1969)
5. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum path cost. IEEE Trans. on on Systems Science and Cybernetics 4, 100–107 (1968)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献