Minimal congestion trees

Let <f>G</f> be a graph and let <f>T</f> be a tree with the same vertex set. Let <f>e</f> be an edge of <f>T</f> and <f>Ae</f> and <f>Be</f> be the vertex sets of the components of <f>T</f> obtained after removal of <f>e</f>. Let <f>EG(Ae,Be)</f> be the set of edges of <f>G</f> with one endvertex in <f>Ae</f> and one endvertex in <f>Be</f>. LetThe paper is devoted to minimization of <f>ec(G:T)</f><f>•</f> Over all trees with the same vertex set as <f>G</f>.<f>•</f> Over all spanning trees of <f>G</f>.These problems can be regarded as “congestion” problems. [Copyright &y& Elsevier]