Decomposition algorithms for finding the shortest path between a source node and a sink node of a network (Q3316989)
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 3847247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition algorithms for finding the shortest path between a source node and a sink node of a network |
scientific article; zbMATH DE number 3847247 |
Statements
Decomposition algorithms for finding the shortest path between a source node and a sink node of a network (English)
0 references
1983
0 references
comparison of algorithms
0 references
Decomposition algorithms
0 references
shortest path
0 references
source node
0 references
sink node
0 references
298.90058
0 references
Shier's algorithm
0 references
0.7777660489082336
0 references
0.7768814563751221
0 references
0.770672619342804
0 references
0.7522379755973816
0 references
