An algorithm for geometric minimum spanning trees requiring nearly linear expected time (Q1824386)

From MaRDI portal
Revision as of 11:12, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
An algorithm for geometric minimum spanning trees requiring nearly linear expected time
scientific article

    Statements

    An algorithm for geometric minimum spanning trees requiring nearly linear expected time (English)
    0 references
    0 references
    1989
    0 references
    linear expected time complexity
    0 references
    minimum spanning tree
    0 references

    Identifiers

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