Finding best swap edges minimizing the routing cost of a spanning tree (Q476426)

From MaRDI portal
Revision as of 09:41, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding best swap edges minimizing the routing cost of a spanning tree
scientific article

    Statements

    Finding best swap edges minimizing the routing cost of a spanning tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    minimum routing-cost spanning tree
    0 references
    transient edge failures
    0 references
    all-best swap edges problems
    0 references
    0 references