On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the optimality of Bellman-Ford-Moore shortest path algorithm |
scientific article; zbMATH DE number 6567997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the optimality of Bellman-Ford-Moore shortest path algorithm |
scientific article; zbMATH DE number 6567997 |
Statements
On the optimality of Bellman-Ford-Moore shortest path algorithm (English)
0 references
13 April 2016
0 references
shortest paths
0 references
matrix multiplication
0 references
dynamic programming
0 references
tropical semiring
0 references
lower bounds
0 references
0.7944605350494385
0 references
0.7928105592727661
0 references
0.7733516693115234
0 references
0.771422803401947
0 references
0.7712276577949524
0 references
