Enumerating \(K\) best paths in length order in DAGs (Q1926859)

From MaRDI portal
Revision as of 01:32, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    29 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    shortest path algorithms
    0 references
    \(K\) best solutions
    0 references
    0 references
    0 references