Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530)

From MaRDI portal
Revision as of 09:09, 27 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
Weighted inverse minimum spanning tree problems under Hamming distance
scientific article

    Statements

    Weighted inverse minimum spanning tree problems under Hamming distance (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2005
    0 references
    0 references
    minimum spanning tree
    0 references
    inverse problem
    0 references
    strongly polynomial algorithm
    0 references