Subcubic cost algorithms for the all pairs shortest path problem
From MaRDI portal
Publication:1386340
DOI10.1007/PL00009198zbMath0898.68030MaRDI QIDQ1386340
Publication date: 19 October 1998
Published in: Algorithmica (Search for Journal in Brave)
Related Items (11)
Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ Unnamed Item ⋮ Algebraic theory on shortest paths for all flows ⋮ An all-pairs shortest path algorithm for bipartite graphs ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ Algebraic Theory on Shortest Paths for All Flows ⋮ All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time ⋮ Efficient reconstruction of metabolic pathways by bidirectional chemical search ⋮ Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication ⋮ An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths
This page was built for publication: Subcubic cost algorithms for the all pairs shortest path problem
