An algorithm for inverse minimum spanning tree problem (Q4378113)

From MaRDI portal
Revision as of 07:10, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1111559)
scientific article; zbMATH DE number 1121326
Language Label Description Also known as
English
An algorithm for inverse minimum spanning tree problem
scientific article; zbMATH DE number 1121326

    Statements

    An algorithm for inverse minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    25 February 1998
    0 references
    0 references
    bipartite graph
    0 references
    inverse minimum spanning tree problem
    0 references
    polynomial time
    0 references
    minimum covering problem
    0 references