Bellman-Ford is optimal for shortest Hop-bounded paths (Q6657034)
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 7961917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bellman-Ford is optimal for shortest Hop-bounded paths |
scientific article; zbMATH DE number 7961917 |
Statements
Bellman-Ford is optimal for shortest Hop-bounded paths (English)
0 references
6 January 2025
0 references
fine-grained complexity
0 references
graph algorithms
0 references
lower bounds
0 references
shortest paths
0 references
