An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jda.2016.09.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2531762745 / rank | |||
Normal rank |
Revision as of 23:18, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths |
scientific article |
Statements
An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (English)
0 references
9 December 2016
0 references
algorithms
0 references
all pairs shortest paths
0 references
graph algorithms
0 references
upper bounds
0 references