论文信息 - Efficient spanning trees

Efficient spanning trees

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.

H. W. Corley | H. Corley

[1] R. Prim. Shortest connection networks and some generalizations , 1957 .

[2] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .

[3] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .

[4] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[5] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[6] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .

[7] Thomas A. Standish. Data Structure Techniques , 1980 .

[8] H. W. Corley,et al. Shortest paths in networks with vector weights , 1985 .