A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs (Q1836991)

From MaRDI portal
Revision as of 18:13, 13 June 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
A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs
scientific article

    Statements

    A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs (English)
    0 references
    1983
    0 references
    0 references
    graph algorithm
    0 references
    parallel algorithm
    0 references
    0 references
    0 references