Efficient spanning trees |
| |
| Authors: | H. W. Corley |
| |
| Affiliation: | (1) Department of Industrial Engineering, University of Texas at Arlington, Arlington, Texas |
| |
| Abstract: | ![]()
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 algorighm for obtaining all efficient spanning trees is presented. |
| |
| Keywords: | Networks graphs trees Pareto optima efficient points algorithms |
| 本文献已被 SpringerLink 等数据库收录！ |
|
