Finding the \(k\) quickest simple paths in a network (Q1322119)

From MaRDI portal
Revision as of 20:19, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding the \(k\) quickest simple paths in a network
scientific article

    Statements

    Finding the \(k\) quickest simple paths in a network (English)
    0 references
    0 references
    9 June 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    design of algorithms
    0 references
    quickest path problem
    0 references
    routing path
    0 references