Author:
Xu M.H.,Liu Y.Q.,Huang Q.L.,Zhang Y.X.,Luan G.F.
Subject
Applied Mathematics,Computational Mathematics
Reference15 articles.
1. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R.E. Tarjan, Faster algorithms for the shortest path problem, Technical Report CS-TR-154-88, Department of Computer Science, Princeton University, 1988.
2. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time? in: Proceedings of 27th ACM Symposium on Theory of Computing, 1995, pp. 427–436.
3. Practical efficiency of the linear-time algorithm for the single source shortest path problem;Asano;J. Oper. Res. Soc. Jpn.,2000
4. On a pouting problem;Bellman;Quart. Appl. Math,1958
5. Algorithm 360: shortest path forest with topological ordering;Dial;Commun. ACM,1969
Cited by
68 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献