An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W40 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6662313 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithms | |||
| Property / zbMATH Keywords: algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
all pairs shortest paths | |||
| Property / zbMATH Keywords: all pairs shortest paths / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph algorithms | |||
| Property / zbMATH Keywords: graph algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
upper bounds | |||
| Property / zbMATH Keywords: upper bounds / rank | |||
Normal rank | |||
Revision as of 09:19, 28 June 2023
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
