Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999)

From MaRDI portal
Revision as of 18:56, 5 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
Arborescence optimization problems solvable by Edmonds' algorithm
scientific article

    Statements

    Arborescence optimization problems solvable by Edmonds' algorithm (English)
    0 references
    30 July 2003
    0 references
    minimum arborescence
    0 references
    minimum directed spanning tree
    0 references
    Bottleneck
    0 references
    arborescence
    0 references
    lexicographically optimal arborescence
    0 references
    widest-minimum spanning tree
    0 references

    Identifiers