Two algorithms for the subset interconnection design problem (Q4018996)

From MaRDI portal
Revision as of 20:52, 23 October 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
Two algorithms for the subset interconnection design problem
scientific article

    Statements

    Two algorithms for the subset interconnection design problem (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    NP-complete generalization
    0 references
    minimum spanning tree
    0 references
    minimum subset interconnection design
    0 references

    Identifiers