Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670)

From MaRDI portal
Revision as of 14:39, 22 May 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
Parallel algorithms for the assignment and minimum-cost flow problems
scientific article

    Statements

    Parallel algorithms for the assignment and minimum-cost flow problems (English)
    0 references
    0 references
    0 references
    12 April 1994
    0 references
    0 references
    parallel algorithm
    0 references
    scaling
    0 references
    assignment problem
    0 references
    bipartite matching
    0 references
    minimum-cost flow
    0 references
    0 references