A graph-theoretical clustering method based on two rounds of minimum spanning trees (Q2654240)

From MaRDI portal
Revision as of 13:24, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A graph-theoretical clustering method based on two rounds of minimum spanning trees
scientific article

    Statements

    A graph-theoretical clustering method based on two rounds of minimum spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    15 January 2010
    0 references
    graph-based clustering
    0 references
    well-separated cluster
    0 references
    touching cluster
    0 references
    two rounds of MST
    0 references

    Identifiers