Thorup's algorithm for single-source shortest paths
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
graphs with non-negative edge weights
undirected graphs |
| gptkbp:compatibleWith |
graphs with negative edge weights
directed graphs |
| gptkbp:complexity |
O(m)
|
| gptkbp:designedBy |
gptkb:Mikkel_Thorup
|
| gptkbp:improves |
gptkb:Dijkstra's_algorithm
|
| gptkbp:notableFor |
linear time complexity
|
| gptkbp:publicationYear |
1999
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:requires |
integer edge weights
|
| gptkbp:solvedBy |
single-source shortest paths
|
| gptkbp:uses |
priority queues
hierarchical bucketing |
| gptkbp:bfsParent |
gptkb:Mikkel_Thorup
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Thorup's algorithm for single-source shortest paths
|