Efficient spanning trees (Q796551): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient spanning trees |
scientific article |
Statements
Efficient spanning trees (English)
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
