External matrix multiplication and all-pairs shortest path

Authors:
Jop F. Sibeyn
Affiliations:
Institut für Informatik, Universität Halle, Germany
Venue:
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Year:
2004

Citing 5
Cited 2

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the all-pairs-shortest-path problem

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A new upper bound on the complexity of the all pairs shortest path problem

Information Processing Letters
Randomized algorithms

Randomized algorithms
Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures

A novel algorithm for all pairs shortest path problem based on matrix multiplication and pulse coupled neural network

Digital Signal Processing
I/O efficient directed model checking

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms are presented for external matrix multiplication and for all-pairs shortest path computation. In comparison with earlier algorithms, the amount of I/O is reduced by a constant factor. The all-pairs shortest path algorithm even performs fewer internal operations, making the algorithm practically interesting.