A new upper bound on the complexity of the all pairs shortest path problem (Q1199881)
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 new upper bound on the complexity of the all pairs shortest path problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound on the complexity of the all pairs shortest path problem |
scientific article |
Statements
A new upper bound on the complexity of the all pairs shortest path problem (English)
0 references
17 January 1993
0 references
all pairs shortest path
0 references
parallel algorithm
0 references
EREW PRAM
0 references
