A fast algorithm for finding all shortest paths (Q1157176)
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 fast algorithm for finding all shortest paths |
scientific article; zbMATH DE number 3737048
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for finding all shortest paths |
scientific article; zbMATH DE number 3737048 |
Statements
A fast algorithm for finding all shortest paths (English)
0 references
1981
0 references
directed graph
0 references
all-pairs shortest path problem
0 references
matrix multiplication
0 references
