External matrix multiplication and all-pairs shortest path
From MaRDI portal
Publication:2390290
DOI10.1016/j.ipl.2004.03.015zbMath1178.68652OpenAlexW2010457207MaRDI QIDQ2390290
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.015
Cites Work
- Unnamed Item
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs
- Matrix multiplication via arithmetic progressions
- A new upper bound on the complexity of the all pairs shortest path problem
- Algorithms for parallel memory, I: Two-level memories
- The input/output complexity of transitive closure
- Algorithms for memory hierarchies. Advanced lectures
- Gaussian elimination is not optimal