On the Complexity of Shortest Path Problems on Discounted Cost Graphs (Q4910440): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W31600139 / rank | |||
Normal rank | |||
Latest revision as of 19:07, 19 March 2024
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
