Path-value functions for which Dijkstra's algorithm returns optimal mapping (Q1799581)
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: Path-value functions for which Dijkstra's algorithm returns optimal mapping |
scientific article; zbMATH DE number 6958557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path-value functions for which Dijkstra's algorithm returns optimal mapping |
scientific article; zbMATH DE number 6958557 |
Statements
Path-value functions for which Dijkstra's algorithm returns optimal mapping (English)
0 references
19 October 2018
0 references
Dijkstra's algorithm
0 references
graph-search algorithms
0 references
image foresting transform
0 references
connectivity functions
0 references
0 references
0 references
0 references
0.85469735
0 references
0 references
0.83336663
0 references
0.83064127
0 references
0.82992435
0 references
0 references
