A parallel algorithm for constructing minimum spanning trees (Q3875355)

From MaRDI portal
Revision as of 18:52, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parallel algorithm for constructing minimum spanning trees
scientific article

    Statements

    title
    A parallel algorithm for constructing minimum spanning trees (English)
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    parallel algorithm
    0 references
    minimum spanning trees of weighted graphs
    0 references
    author
    Jon Louis Bentley
    0 references

    Identifiers

    zbMATH DE Number
    3679193
    0 references
    OpenAlex ID
    W2012667106
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3875355&oldid=31415943"
    Powered by MediaWiki