Enumerating \(K\) best paths in length order in DAGs (Q1926859)
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: Enumerating \(K\) best paths in length order in DAGs |
scientific article; zbMATH DE number 6119449
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating \(K\) best paths in length order in DAGs |
scientific article; zbMATH DE number 6119449 |
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
0 references
0 references
0 references
0 references
