A decomposition algorithm for locating a shortest path between two nodes in a network (Q3944019)
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: A decomposition algorithm for locating a shortest path between two nodes in a network |
scientific article; zbMATH DE number 3761419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A decomposition algorithm for locating a shortest path between two nodes in a network |
scientific article; zbMATH DE number 3761419 |
Statements
A decomposition algorithm for locating a shortest path between two nodes in a network (English)
0 references
1982
0 references
directed cycles
0 references
arbitrary arc distances
0 references
