Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269)
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 992087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient parallel algorithms for computing all pair shortest paths in directed graphs |
scientific article; zbMATH DE number 992087 |
Statements
Efficient parallel algorithms for computing all pair shortest paths in directed graphs (English)
0 references
20 August 1997
0 references
shortest paths
0 references
directed graphs
0 references
0.8291246294975281
0 references
0.8209073543548584
0 references
0.8145830631256104
0 references
