Finding maximum matching for bipartite graphs in parallel (Q1342094)

From MaRDI portal
Revision as of 02:10, 19 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 maximum matching for bipartite graphs in parallel
scientific article

    Statements

    Finding maximum matching for bipartite graphs in parallel (English)
    0 references
    0 references
    11 January 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithm
    0 references
    maximum matching
    0 references
    bipartite graphs
    0 references