Efficient spanning trees (Q796551)

From MaRDI portal
Revision as of 18:39, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient spanning trees
scientific article

    Statements

    Efficient spanning trees (English)
    0 references
    0 references
    1985
    0 references
    The definition of a shortest spanning tree of a graph is generalized to that of an efficient spanning tree for graphs with vector weights, where the notion of optimality is of the Pareto type. An algorithm for obtaining all efficient spanning trees is presented.
    0 references
    Pareto optimum
    0 references
    spanning tree
    0 references
    vector weights
    0 references

    Identifiers