Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction (Q3434697)
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 5148729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction |
scientific article; zbMATH DE number 5148729 |
Statements
Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction (English)
0 references
2 May 2007
0 references
0.8228139281272888
0 references
0.7791581749916077
0 references
0.7770786285400391
0 references
0.7758012413978577
0 references
0.7409912943840027
0 references
