Shortest-path problem is not harder than matrix multiplication (Q1149782)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest-path problem is not harder than matrix multiplication |
scientific article |
Statements
Shortest-path problem is not harder than matrix multiplication (English)
0 references
1980
0 references
transitive closure
0 references
