The complexity of ultrametric partitions on graphs (Q1098632)

From MaRDI portal
Revision as of 15:07, 18 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 complexity of ultrametric partitions on graphs
scientific article

    Statements

    The complexity of ultrametric partitions on graphs (English)
    0 references
    0 references
    1988
    0 references
    cluster analysis
    0 references
    automated design
    0 references
    VLSI circuits
    0 references
    ultrametric partitions
    0 references
    weighted complete graph
    0 references
    computational complexity
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers