Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
O(n^{2.575})
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:improves |
gptkb:Floyd–Warshall_algorithm
|
| gptkbp:input |
weighted directed graph
|
| gptkbp:namedAfter |
gptkb:Uri_Zwick
|
| gptkbp:output |
shortest path distances between all pairs of vertices
|
| gptkbp:publicationYear |
2002
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:solvedBy |
all-pairs shortest paths problem
|
| gptkbp:uses |
fast matrix multiplication
|
| gptkbp:bfsParent |
gptkb:Uri_Zwick
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Zwick's algorithm
|