On finding shortest paths in arc-dependent networks (Q2225067)
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 7306398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding shortest paths in arc-dependent networks |
scientific article; zbMATH DE number 7306398 |
Statements
On finding shortest paths in arc-dependent networks (English)
0 references
4 February 2021
0 references
simple paths, NP-complete, negative cost cycles
0 references
0.9578002095222472
0 references
0.7585100531578064
0 references
0.7308090329170227
0 references
