Efficient spanning trees (Q796551)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient spanning trees |
scientific article; zbMATH DE number 3865333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient spanning trees |
scientific article; zbMATH DE number 3865333 |
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
0.8287569284439087
0 references
