An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829)

From MaRDI portal
Revision as of 02:16, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
scientific article

    Statements

    title
    An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (English)
    0 references
    author
    Taenam Kim
    0 references
    Kyung-Yong Chwa
    0 references
    publication date
    1987
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    68Q25
    0 references
    zbMATH DE Number
    4011956
    0 references
    zbMATH Keywords
    bipartite graphs
    0 references
    parallel algorithm
    0 references
    serial algorithm
    0 references
    computational complexity
    0 references
    matching
    0 references
    tree
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1091829&oldid=13119602"
    Powered by MediaWiki