Efficient spanning trees (Q796551): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in networks with vector weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:29, 14 June 2024

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