Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238)

From MaRDI portal
Revision as of 22:53, 26 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
Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
scientific article

    Statements

    Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    most vital edges
    0 references
    minimum spanning tree
    0 references
    exact algorithms
    0 references
    mixed integer program
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references