Load Balanced Spanning TreeCost Criteria

• Given a graph G = (V,E) and a spanning tree T.

  • d(T) = max degree of any vertex of T
  • c(T) = sum of the squares of the degrees

d(T) = 3

c(T) = 4*1 + 1*4 + 2*9 = 26

Advantage of c(T) is that

it has finer gradations.

Previous slide

Next slide

Back to first slide

View graphic version