A more efficient algorithm for the min-plus multiplication
From MaRDI portal
Cited in
(16)- A survey of the all-pairs shortest paths problem and its variants in graphs
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
- Improved algorithm for all pairs shortest paths
- Faster all-pairs shortest paths via circuit complexity
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
- An all-pairs shortest path algorithm for bipartite graphs
- An O(n^3 n / ^2 n) time algorithm for all pairs shortest paths
- From circuit complexity to faster all-pairs shortest paths
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
- An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
- A new upper bound on the complexity of the all pairs shortest path problem
- Bit complexity of matrix products
- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
This page was built for publication: A more efficient algorithm for the min-plus multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009726)
