Generalization of multicriterion problem on determination of the shortest paths in oriented graph (Q3599569)
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: Generalization of multicriterion problem on determination of the shortest paths in oriented graph |
scientific article; zbMATH DE number 5502578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalization of multicriterion problem on determination of the shortest paths in oriented graph |
scientific article; zbMATH DE number 5502578 |
Statements
4 February 2009
0 references
generalization of Dejkstra algorithm
0 references
algorithm correctness
0 references
0.8162843585014343
0 references
0.7967024445533752
0 references
