Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 08:50, 1 February 2024

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