Algorithms for the optimum communication spanning tree problem (Q2507388)

From MaRDI portal
Revision as of 21:37, 24 June 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
Algorithms for the optimum communication spanning tree problem
scientific article

    Statements

    Algorithms for the optimum communication spanning tree problem (English)
    0 references
    0 references
    11 October 2006
    0 references
    0 references
    cost of communication
    0 references
    cut-tree
    0 references
    star-tree
    0 references
    adjacent spanning tree
    0 references
    adjacent basic feasible solution
    0 references
    0 references