External matrix multiplication and all-pairs shortest path |
| |
| Authors: | Jop F. Sibeyn |
| |
| Affiliation: | Institut für Informatik, Universität Halle, Germany |
| |
| 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. |
| |
| Keywords: | External algorithms All-pairs shortest paths Matrix multiplication Graph algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
