More Algorithms for All-Pairs Shortest Paths in Weighted Graphs (Q3053160): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56170983 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/08071990x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3022326557 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:28, 30 July 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
4 November 2010
0 references
shortest paths
0 references
graph algorithms
0 references
small-integer-weighted graphs
0 references
computational geometry
0 references
matrix multiplication
0 references
APSP
0 references
