Finding maximum matching for bipartite graphs in parallel (Q1342094)

From MaRDI portal
Revision as of 04:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Finding maximum matching for bipartite graphs in parallel
scientific article

    Statements

    title
    Finding maximum matching for bipartite graphs in parallel (English)
    0 references
    author
    Pranay Chaudhuri
    0 references
    publication date
    11 January 1995
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    05C70
    0 references
    90C60
    0 references
    65Y05
    0 references
    zbMATH DE Number
    709967
    0 references
    zbMATH Keywords
    parallel algorithm
    0 references
    maximum matching
    0 references
    bipartite graphs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1342094&oldid=26165125"
    Powered by MediaWiki