On the Exponent of the All Pairs Shortest Path Problem
暂无分享,去创建一个
Noga Alon | Zvi Galil | Oded Margalit | N. Alon | Z. Galil | Oded Margalit
[1] Raimund Seidel,et al. On the all-pairs-shortest-path problem , 1992, STOC '92.
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .
[4] V. Strassen. Gaussian elimination is not optimal , 1969 .
[5] Gideon Yuval,et al. An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications , 1976, Inf. Process. Lett..
[6] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..
[7] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[8] Noga Alon,et al. Witnesses for Boolean matrix multiplication and for shortest paths , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[9] Harold N. Gabow,et al. Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[10] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[11] Kurt Mehlhorn,et al. Faster algorithms for the shortest path problem , 1990, JACM.