External matrix multiplication and all-pairs shortest path

Information Processing Letters

Volumn 91, Issue 2, 2004, Pages 99-106

  Sibeyn, Jop F ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

All pairs shortest paths; External algorithms; Graph algorithms; Matrix multiplication

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; THEOREM PROVING;

ALL-PAIRS SHORTEST PATHS; EXTERNAL ALGORITHMS; GRAPH ALGORITHMS; MATRIX MULTIPLICATION;

DATA PROCESSING;

EID: 2942596460     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.03.015     Document Type: Article

References (11)

1. Coppersmith D., Winograd S. Matrix multiplication via arithmetical progressions. J. Symbolic Comput. 9:1990;251-280.
2. Han Y., Pan V.Y., Reif J.H. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. Algorithmica. 17:1997;399-415.
3. Meyer U., Sanders P., Sibeyn J.F. Tutorial on Algorithms for Memory Hierarchies. Lecture Notes in Comput. Sci. vol. 2625:2003;Springer-Verlag, Berlin/New York.
4. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge Univ. Press, Cambridge.
5. Pan V.Y. Strassen's algorithm is not optimal. Proc. 19th Symposium on Foundations of Computer Science. 1978;166-176 IEEE.
6. Takaoka T. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett. 43:1992;195-199.
7. Seidel R.G. On the all-pairs-shortest-path problem. Proc. 24th Symposium on Theory of Computing. 1992;745-749 ACM.
8. Strassen V. Gaussian elimination is not optimal. Numer. Math. 13:1969;354-356.
9. Ullman J.D., Yannakakis M. The input/output complexity of transitive closure. Ann. Math. Artificial Intelligence. 3:1991;331-360.
10. Vitter J.S. External memory algorithms. Proc. 6th European Symposium on Algorithms Lecture Notes in Comput. Sci. vol. 1461:1998;1-25 Springer-Verlag, Berlin/New York.
11. Vitter J.S., Shriver E.A.M. Algorithms for parallel memory I: Two-level memories. Algorithmica. 12:(2-3):1994;110-147.