An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346)

From MaRDI portal
Revision as of 16:35, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
scientific article

    Statements

    An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    complexity
    0 references
    components
    0 references
    sorting
    0 references
    non-numerical algorithms
    0 references
    parallel algorithm
    0 references
    minimum spanning tree
    0 references
    undirected graph
    0 references

    Identifiers

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