The expected complexity of Prim's minimum spanning tree algorithm (Q1603503)

From MaRDI portal
Revision as of 11:48, 4 June 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
The expected complexity of Prim's minimum spanning tree algorithm
scientific article

    Statements

    The expected complexity of Prim's minimum spanning tree algorithm (English)
    0 references
    14 July 2002
    0 references
    graph algorithms
    0 references
    data structures
    0 references
    minimum spanning tree
    0 references
    expected performance
    0 references
    0 references

    Identifiers