Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference16 articles.
1. Timothy M. Chan, More algorithms for all-pairs shortest paths in weighted graphs, in: STOC'07, 2007, pp. 590–598
2. All-pairs shortest paths with real weights in O(n3/logn) time;Chan;Algorithmica,2008
3. Algorithm 97: Shortest path;Floyd;Communications of the ACM,1962
4. New bounds on the complexity of the shortest path problem;Fredman;SIAM Journal on Computing,1976
5. Yijie Han, An O(n3loglogn/log2n) time algorithm for all pairs shortest paths, Manuscript, 2009
Cited by
154 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献