Finding the k most vital edges in the minimum spanning tree problem (Q1127438)

From MaRDI portal
Revision as of 10:24, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding the k most vital edges in the minimum spanning tree problem
scientific article

    Statements

    Finding the k most vital edges in the minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    13 August 1998
    0 references
    0 references
    combinatorial algorithms
    0 references
    minimum spanning trees
    0 references
    most vital edges
    0 references
    NC algorithms
    0 references
    network optimization
    0 references
    0 references