Efficient spanning trees

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1985 English Publisher:Springer Science and Business Media LLCJournal:Journal of Optimization Theory and Applications, volume 45, pages 481-485 (issn: 0022-3239, eissn: 1573-2878,

Copyright policy )

Authors: Corley, H. W.;

doi: 10.1007/bf00938448

Efficient spanning trees

- Summary
- Subjects
- Metrics

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 algorithm for obtaining all efficient spanning trees is presented.

Related Organizations

The University of Texas at Arlington
United States

Keywords

Graph theory, spanning tree, vector weights, Pareto optimum, Trees

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	25
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average