Author:
Berman Piotr,Kasiviswanathan Shiva Prasad
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: STOC 2007, ACM (to appear)
2. Galil, Z., Margalit, O.: All pairs shortest distances for graphs with small integer length edges. Information and Computation 134(2), 103–139 (1997)
3. Galil, Z., Margalit, O.: All pairs shortest paths for graphs with small integer length edges. JCSS 54(2), 243–254 (1997)
4. Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. JCSS 51 (1995)
5. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetical progressions. Journal of Symbolic Computation 9, 251–280 (1990)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献