A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (Q4785625)

From MaRDI portal
Revision as of 19:46, 8 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56077919, #quickstatements; #temporary_batch_1704735187142)
scientific article; zbMATH DE number 1848443
Language Label Description Also known as
English
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
scientific article; zbMATH DE number 1848443

    Statements

    A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (English)
    0 references
    0 references
    0 references
    5 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithm
    0 references
    minimum spanning tree
    0 references
    optimal algorithm
    0 references
    EREW PRAM
    0 references
    0 references