Shortest-path problem is not harder than matrix multiplication (Q1149782): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(80)90128-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089633648 / rank | |||
Normal rank | |||
Revision as of 21:03, 19 March 2024
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
