An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (Q3985808)

From MaRDI portal
Revision as of 00:59, 24 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56271078, #quickstatements; #temporary_batch_1711234560214)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
scientific article

    Statements

    An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (English)
    0 references
    0 references
    27 June 1992
    0 references
    parallel randomized algorithm
    0 references
    connected components
    0 references
    CRCW
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references