Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q163211 |
Changed an Item |
||
| Property / author | |||
| Property / author: Pan, Victor Y. / rank | |||
Normal rank | |||
Revision as of 22:47, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel algorithms for computing all pair shortest paths in directed graphs |
scientific article |
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
