Minimum Cost Spanning Trees & Applications
Minimum Cost Spanning Trees & Applications
Minimum Cost Spanning Trees & Applications
Tree
Tree
A tree is a graph with the following properties:
The graph is connected (can go from anywhere to anywhere)
Tree
trees.
4
Spanning trees
tree is then a spanning tree with weight less than or equal to the weight of every other spanning tree.
Addition of even one single edge results in the spanning tree losing its
The length of a tree is equal to the sum of the length of the arcs on the
tree.
Properties
Possible multiplicity
There may be several minimum spanning trees of the same weight
Uniqueness
If each edge has a distinct weight then there will be only one, unique
Cycle Property: Let T be a minimum spanning tree of a weighted graph G Let e be an edge of G that is not in T and let C be the cycle formed by e with T For every edge f of C, weight(f) weight(e) If weight(f) > weight(e) we can get a spanning tree of smaller weight by replacing e with f
f 2 6
C
8 7
4
9 3 e 7
f
2 6
8
4 9 3 7 e 7
C
8
Partition Property: Consider a partition of the vertices of G into subsets U and V Let e be an edge of minimum weight across the partition There is a minimum spanning tree of G containing edge e Proof: Let T be an MST of G If T does not contain e, consider the cycle C formed by e with T and let f be an edge of C across the partition By the cycle property, weight(f) weight(e) Thus, weight(f) = weight(e) We obtain another MST by replacing f with e
U f 2 5 8 7
7 9 8
U f 2 5 8
e
7
cost
A
19
16 21 11 33
B
5
A C
10
16 11
B
5
F
18
14
F
E
18
communication network.
The laying of communication links between any two stations involves a
cost.
The problem is to obtain a network of communication links which
while preserving the connectivity between stations does it with minimum cost.
The ideal solution to the problem would be to extract a sub graph
Applications contd
Suppose you want to supply a set of houses with:
electric power water sewage lines telephone lines
To keep costs down, you could connect these houses with a spanning tree ( for example, power lines)
However, the houses are not all equal distances apart
Applications contd
Applications contd
The phone company task is to provide phone lines to a village with 10
The two valid spanning trees from the above graph. The edges forming the spanning tree are bolded.
Central office
Central office
Expensive!
Central office
Thank you