A new upper bound on the complexity of the all pairs shortest path problem (Q1199881): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:30, 5 March 2024
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
