Computing the shortest path: \(A^\ast\) search meets graph theory (Q2921666)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the shortest path: \(A^\ast\) search meets graph theory |
scientific article; zbMATH DE number 6354824
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the shortest path: \(A^\ast\) search meets graph theory |
scientific article; zbMATH DE number 6354824 |
Statements
13 October 2014
0 references
Computing the shortest path: \(A^\ast\) search meets graph theory (English)
0 references
