Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226)

From MaRDI portal
Revision as of 07:52, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Optimal parallel algorithms for multiple updates of minimum spanning trees
scientific article

    Statements

    title
    Optimal parallel algorithms for multiple updates of minimum spanning trees (English)
    0 references
    DOI
    10.1007/BF01228509
    0 references
    author
    Owen Kaser
    0 references
    Shaunak R. Pawagi
    0 references
    published in
    Algorithmica
    0 references
    publication date
    29 June 1993
    0 references
    Mathematics Subject Classification ID
    68W15
    0 references
    68R10
    0 references
    05C05
    0 references
    zbMATH DE Number
    223467
    0 references
    zbMATH Keywords
    CREW PRAM
    0 references
    updates
    0 references
    minimum spanning trees
    0 references
    efficient algorithm
    0 references
    parallel algorithms
    0 references
    bounds
    0 references
    bipartite graph
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2366226&oldid=26907470"
    Powered by MediaWiki