More Algorithms for All-Pairs Shortest Paths in Weighted Graphs (Q3053160)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5810178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More Algorithms for All-Pairs Shortest Paths in Weighted Graphs |
scientific article; zbMATH DE number 5810178 |
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
0.9215306
0 references
0.91981256
0 references
0.9162587
0 references
0.91382885
0 references
0.91025066
0 references
0.90844864
0 references
0.9071754
0 references
0 references
0 references
