An Improved Distribution Algorithm for Shortest Paths Problem (Q3335005)
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: An Improved Distribution Algorithm for Shortest Paths Problem |
scientific article; zbMATH DE number 3868636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Improved Distribution Algorithm for Shortest Paths Problem |
scientific article; zbMATH DE number 3868636 |
Statements
An Improved Distribution Algorithm for Shortest Paths Problem (English)
0 references
1984
0 references
systolic architecture
0 references
VLSI layout
0 references
time complexity
0 references
distributed algorithm
0 references
all-pair shortest path problem
0 references
pipelining
0 references
area complexity
0 references
0.8177843689918518
0 references
0.8035895824432373
0 references
0.8014208078384399
0 references
0.7953431010246277
0 references
0.7953155040740967
0 references
