A sharper analysis of a prallel algorithm for the all pairs shortest path problem (Q919832)
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 sharper analysis of a prallel algorithm for the all pairs shortest path problem |
scientific article; zbMATH DE number 4162271
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharper analysis of a prallel algorithm for the all pairs shortest path problem |
scientific article; zbMATH DE number 4162271 |
Statements
A sharper analysis of a prallel algorithm for the all pairs shortest path problem (English)
0 references
1990
0 references
all pairs shortest path problem
0 references
directed complete graph
0 references
repeated ``plus-min'' algorithm
0 references
SIMD-SM-RW computer
0 references
0.8602972626686096
0 references
0.8481398820877075
0 references
