Enumerating \(K\) best paths in length order in DAGs (Q1926859): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 22:06, 29 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
