Author:
Fong Ken,Li Minming,Liang Hongyu,Yang Linji,Yuan Hao
Publisher
Springer International Publishing
Reference20 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)
2. Bloniarz, P.A.: A shortest-path algorithm with expected time
$${O}(n^2 \log n\log ^*n)$$
. SIAM Journal on Computing 12(3), 588–600 (1983).
http://link.aip.org/link/?SMJ/12/588/1
3. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences 7(4), 448–461 (1973).
http://www.sciencedirect.com/science/article/pii/S0022000073800339
4. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. SIAM Journal on Computing 39(5), 2075–2089 (2010)
5. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990).
http://www.sciencedirect.com/science/article/pii/S0747717108800132