A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (Q5132024)

From MaRDI portal
Revision as of 10:43, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7271902
Language Label Description Also known as
English
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs
scientific article; zbMATH DE number 7271902

    Statements

    title
    A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (English)
    0 references
    publication date
    9 November 2020
    0 references
    zbMATH Keywords
    bipartite graphs
    0 references
    matching
    0 references
    parallel algorithms
    0 references
    transversals
    0 references
    cites work
    Q5198965
    0 references
    Q5519710
    0 references
    SuperLU_DIST
    0 references
    Q2833177
    0 references

    Identifiers

    DOI
    10.1137/18M1189348
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C85
    0 references
    05C22
    0 references
    68W10
    0 references
    05D15
    0 references
    68W25
    0 references
    zbMATH DE Number
    7271902
    0 references
    Wikidata QID
    Q114978700
    0 references
    arXiv ID
    1801.09809
    0 references
    OpenAlex ID
    W3098045814
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5132024&oldid=37137267"
    Powered by MediaWiki