# co.combinatorics – Maximize sum of verge weights on spanning tree Answer

Hello expensive customer to our community We will proffer you an answer to this query co.combinatorics – Maximize sum of verge weights on spanning tree ,and the respond will breathe typical via documented data sources, We welcome you and proffer you fresh questions and solutions, Many customer are questioning concerning the respond to this query.

co.combinatorics – Maximize sum of verge weights on spanning tree

Problem: Given a whole graph with n vertices,The verge weight between vertex $$i$$ and vertex $$j$$ is $$b[i]instances b[j]$$

Under the situation that the diploma of level $$i$$ on spanning tree is DEG $$[i]$$, let the sum of all verge weights on spanning tree is maximized.

I marvel if there’s a polynomial time algorithm for this downside.

If so, what ought to the algorithm do? Why is it privilege? Has there been any dialogue within the hypothetical coterie?

we are going to proffer you the answer to co.combinatorics – Maximize sum of verge weights on spanning tree query by way of our community which brings all of the solutions from a number of dependable sources.