An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
From MaRDI portal
Publication:350723
DOI10.1016/j.jda.2016.09.001zbMath1351.05213MaRDI QIDQ350723
Publication date: 9 December 2016
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2016.09.001
68W40: Analysis of algorithms
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)