The Shortest-Path Problem: Analysis and Comparison of Methods (Q5255986): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2200/s00618ed1v01y201412tcs001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2164399552 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:32, 30 July 2024
scientific article; zbMATH DE number 6448011
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
