On the Complexity of Shortest Path Problems on Discounted Cost Graphs (Q4910440)
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: On the Complexity of Shortest Path Problems on Discounted Cost Graphs |
scientific article; zbMATH DE number 6145856
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Shortest Path Problems on Discounted Cost Graphs |
scientific article; zbMATH DE number 6145856 |
Statements
On the Complexity of Shortest Path Problems on Discounted Cost Graphs (English)
0 references
18 March 2013
0 references
