Shortest-path problem is not harder than matrix multiplication
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
- Complexity measures for matrix multiplication algorithms
- Gaussian elimination is not optimal
- Partial and Total Matrix Multiplication
Cited in
(15)- The bit-operation complexity of matrix multiplication and of all pair shortest path problem
- Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
- Faster all-pairs shortest paths via circuit complexity
- Bounds for semi-disjoint bilinear forms in a unit-cost computational model
- A fast algorithm for finding all shortest paths
- Author's reply to S. Moran's note on the shortest path problem
- Complexité de problèmes liés aux graphes sans circuit
- The Bounded Path Tree Problem
- From circuit complexity to faster all-pairs shortest paths
- A priority queue for the all pairs shortest path problem
- Bit complexity of matrix products
- A note on 'Is shortest path problem not harder than matrix multiplication?'
- Sub-cubic cost algorithms for the all pairs shortest path problem
- Unified all-pairs shortest path algorithms in the chordal hierarchy
- scientific article; zbMATH DE number 3795354 (Why is no real title available?)
This page was built for publication: Shortest-path problem is not harder than matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149782)
