More algorithms for all-pairs shortest paths in weighted graphs (Q3549660): 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.1145/1250790.1250877 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152290683 / rank | |||
Normal rank | |||
Latest revision as of 22:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More algorithms for all-pairs shortest paths in weighted graphs |
scientific article |
Statements
More algorithms for all-pairs shortest paths in weighted graphs (English)
0 references
5 January 2009
0 references
all-pairs shortest paths problem
0 references
fast matrix multiplication
0 references
truly subcubic APSP algorithms
0 references
