Computing Euclidean maximum spanning trees (Q911288)

From MaRDI portal
Revision as of 01:10, 7 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing Euclidean maximum spanning trees
scientific article

    Statements

    Computing Euclidean maximum spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    spanning trees
    0 references
    furthest-neighbor graph
    0 references
    clusters
    0 references
    diameter-partitioning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references