External matrix multiplication and all-pairs shortest path
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. (C) 2004 Elsevier B.V. All rights reserved.
matrix multiplication all-pairs shortest paths external algorithms graph algorithms