Scribd
Upload
33 views

Minimum Spanning Trees: Proof of The Cut Property

This document provides a proof of the Cut Property for minimum spanning trees (MSTs). It will argue by contradiction using an exchange argument. If an edge e is the cheapest crossing a cut (A,B) but is not in the MST T*, it will exchange e with another edge f in T* to create a cheaper spanning tree, a contradiction. It may not always be possible to directly exchange e for an edge f in T* since this could create a cycle. However, using the Double-Crossing Lemma, there is another edge e' in the cycle that crosses the cut, and exchanging e for e' will yield a bona fide spanning tree cheaper than T*, proving the contradiction.

Uploaded by

sirj0_hn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Minimum Spanning Trees: Proof of The Cut Property

This document provides a proof of the Cut Property for minimum spanning trees (MSTs). It will argue by contradiction using an exchange argument. If an edge e is the cheapest crossing a cut (A,B) but is not in the MST T*, it will exchange e with another edge f in T* to create a cheaper spanning tree, a contradiction. It may not always be possible to directly exchange e for an edge f in T* since this could create a cycle. However, using the Double-Crossing Lemma, there is another edge e' in the cycle that crosses the cut, and exchanging e for e' will yield a bona fide spanning tree cheaper than T*, proving the contradiction.

Uploaded by

sirj0_hn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Minimum

Spanning Trees

Proof of the Cut


Algorithms: Design
and Analysis, Part II Property
The Cut Property

Assumption: Distinct edge costs.

CUT PROPERTY: Consider an edge e of G . Suppose there is a


cut (A, B) such that e is the cheapest edge of G that crosses it.
Then e belongs to the MST of G .

Tim Roughgarden
Proof Plan
Will argue by contradiction, using an exchange argument.
[Compare to scheduling application]

Suppose there is an edge e that is the cheapest one crossing a cut


(A, B), yet e is not in the MST T ∗ .

Idea: Exchange e with another edge in T ∗ to make it even cheaper


(contradiction).

Question: Which edge to exchange e with?

Tim Roughgarden
Attempted Exchange

f ∈ T∗

A B

Cheapest edge of G crossing


(A, B); also not in T ∗
(so ce < cf )

Note: Since T ∗ is connected, must construct an edge f (6= e)


crossing (A, B).

Idea: Exchange e and f to get a spanning tree cheaper than T ∗


(contradiction).

Tim Roughgarden
Exchanging Edges
Question: Let T ∗ be a spanning tree of G , e ∈
/ T ∗ , f ∈ T ∗ . Is
∗
T ∪ {e} − {f } a spanning tree of G ?

A) Yes always
B) No never
C) If e is the cheapest edge crossing some cut, then yes
D) Maybe, maybe not (depending on the choice of e and f )

f (T ∗ = pink edes)

A B
e

e

Exchange e, f: Exchange e, e’:

(not a spanning tree) (a spanning tree)

Tim Roughgarden
Smart Exchanges
Hope: Can always find suitable edge e 0 so that exchange yields
bona fide spanning tree of G .

How? Let C = cycle created by adding e to T ∗ .

f (T ∗ = pink edes)

e B
A
C
e

By the Double-Crossing Lemma: Some other edge e 0 of C [with


e 0 6= e and e 0 ∈ T ∗ ] crosses (A, B).
You check: T = T ∗ ∪ {e} − {e 0 } is also a spanning tree.
Since ce < ce 0 , T cheaper than purported MST T ∗ , contradiction.

Tim Roughgarden

You might also like