A fast algorithm for finding all shortest paths

DOI10.1016/0020-0190(81)90139-3MaRDI QIDQ1157176zbMATH OpenOpenAlexFDO

Authors Osamu Watanabe

Publication date 1981

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(81)90139-3

zbMATH Keywords

directed graphmatrix multiplicationall-pairs shortest path problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
• Gaussian elimination is not optimal
• Shortest-path problem is not harder than matrix multiplication

Cited in

(1)

• Graph theory (algorithmic, algebraic, and metric problems)

This page was built for publication: A fast algorithm for finding all shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157176)