Enumerating \(K\) best paths in length order in DAGs (Q1926859): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q296814 |
Changed an Item |
||
| Property / author | |||
| Property / author: Antonio Sedeño-Noda / rank | |||
Normal rank | |||
Revision as of 17:58, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating \(K\) best paths in length order in DAGs |
scientific article |
Statements
Enumerating \(K\) best paths in length order in DAGs (English)
0 references
29 December 2012
0 references
combinatorial optimization
0 references
shortest path algorithms
0 references
\(K\) best solutions
0 references
