An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931)

From MaRDI portal
Revision as of 08:18, 2 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
An adjustable linear time parallel algorithm for maximum weight bipartite matching
scientific article

    Statements

    An adjustable linear time parallel algorithm for maximum weight bipartite matching (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    parallel algorithms
    0 references
    graph algorithms
    0 references
    bipartite matching
    0 references
    0 references