The shortest-path problem. Analysis and comparison of methods (Q5255986)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6448011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The shortest-path problem. Analysis and comparison of methods |
scientific article; zbMATH DE number 6448011 |
Statements
The Shortest-Path Problem: Analysis and Comparison of Methods (English)
0 references
22 June 2015
0 references
shortest path problem
0 references
graph algorithms
0 references
graph search
0 references
Dijkstra's algorithm
0 references
\(A^*\) algorithm
0 references
preprocessing-dependent approaches, hierarchical approaches
0 references
non-hierarchical approaches
0 references
0.8334862589836121
0 references
0.8112843632698059
0 references
0.8070665597915649
0 references
0.8063660860061646
0 references
0.8041924834251404
0 references
