The Complexity of Computing Steiner Minimal Trees (Q4182533)

From MaRDI portal
Revision as of 04:52, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q105723921, #quickstatements; #temporary_batch_1711504539957)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3619923
Language Label Description Also known as
English
The Complexity of Computing Steiner Minimal Trees
scientific article; zbMATH DE number 3619923

    Statements

    The Complexity of Computing Steiner Minimal Trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1977
    0 references
    0 references
    0 references
    0 references
    0 references
    Computing Steiner Minimal Trees
    0 references
    Complexity
    0 references
    0 references
    0 references