Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (Q5199145)

From MaRDI portal
Revision as of 01:23, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5938172
Language Label Description Also known as
English
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem
scientific article; zbMATH DE number 5938172

    Statements

    Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (English)
    0 references
    0 references
    0 references
    0 references
    12 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    most vital edges
    0 references
    minimum spanning tree
    0 references
    exact algorithms
    0 references
    mixed integer program
    0 references
    0 references