Shortest-path problem is not harder than matrix multiplication (Q1149782)
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: Shortest-path problem is not harder than matrix multiplication |
scientific article; zbMATH DE number 3711406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest-path problem is not harder than matrix multiplication |
scientific article; zbMATH DE number 3711406 |
Statements
Shortest-path problem is not harder than matrix multiplication (English)
0 references
1980
0 references
transitive closure
0 references
