Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711)

From MaRDI portal
Revision as of 19:26, 5 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
Parallel algorithms for bipartite matching problems on distributed memory computers
scientific article

    Statements

    title
    Parallel algorithms for bipartite matching problems on distributed memory computers (English)
    0 references
    author
    Johannes Langguth
    0 references
    Fredrik Manne
    0 references
    publication date
    18 October 2012
    0 references
    Mathematics Subject Classification ID
    65Y05
    0 references
    68M14
    0 references
    68R10
    0 references
    zbMATH DE Number
    6094862
    0 references
    zbMATH Keywords
    bipartite graphs
    0 references
    parallel algorithms
    0 references
    matching
    0 references
    describes a project that uses
    SparseMatrix
    0 references
    PSPIKE
    0 references
    BSPlib
    0 references
    MC21A
    0 references
    BSPedupack
    0 references
    OpenAlex ID
    W2089353209
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q712711&oldid=35303225"
    Powered by MediaWiki