theorem in graph theory history and concepts behind the ...the max-flow, min-cut theorem1 theorem:...
TRANSCRIPT
![Page 1: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/1.jpg)
Max-Flow, Min-CutHistory and Concepts Behind the Max-Flow, Min-Cut
Theorem in Graph Theory
Greg EusdenApril 6, 2013
![Page 2: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/2.jpg)
Some Brief Context(Why do we care?)
● Scene: The Cold War in the 1950's● Question: What is
the optimal way to disrupt the rail network between the Soviet Union and Eastern Germany?
1 Image due to Harris and Ross (1954)
![Page 3: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/3.jpg)
1. Basic Background
2. Cuts
3. Flows
4. The Max-Flow, Min-Cut Theorem
5. Conclusion
Agenda
![Page 4: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/4.jpg)
Basic Background
● A directed, weighted graph is called a (flow) network.
● Each edge has a weight and direction.
● We assume there exists a source and a sink.
![Page 5: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/5.jpg)
1. Basic Background
2. Cuts
3. Flows
4. The Max-Flow, Min-Cut Theorem
5. Conclusion
Agenda
![Page 6: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/6.jpg)
Cuts
● A cut is a partition of the vertices into disjoint subsets S and T. In a flow network, the source is located in S, and the sink is located in T.
● The cut-set of a cut is the set of edges that begin in S and end in T.
● The capacity of a cut is sum of the weights of the edges beginning in S and ending in T.
![Page 7: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/7.jpg)
Cut Examples
Consider a basic flow network.
![Page 8: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/8.jpg)
Cut Examples (cont'd)
![Page 9: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/9.jpg)
Cut Examples (cont'd)
![Page 10: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/10.jpg)
1. Basic Background
2. Cuts
3. Flows
4. The Max-Flow, Min-Cut Theorem
5. Conclusion
Agenda
![Page 11: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/11.jpg)
Flow
The flow over a network is a function f: E -> R, assigning values to each of the edges in the network which are nonnegative and less than the capacity of that edge. For each intermediate vertex, the outflow and inflow must be equal.
The value of this flow is the total amount leaving the source (and thus entering the sink).
![Page 12: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/12.jpg)
Flow Example
![Page 13: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/13.jpg)
Flow Example (cont'd)
![Page 14: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/14.jpg)
1. Basic Background
2. Cuts
3. Flows
4. The Max-Flow, Min-Cut Theorem
5. Conclusion
Agenda
![Page 15: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/15.jpg)
The Max-Flow, Min-Cut Theorem1
Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum cut.
1 The max-flow min-cut theorem was proven by Ford and Fulkerson in 1954 for undirected graphs and 1955 for directed graphs.
![Page 16: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/16.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
6
3
2
34
114
4
11
19
46
8
51
8
2
![Page 17: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/17.jpg)
The Ford-Fulkerson Algorithm
The Ford-Fulkerson algorithm for finding the maximum flow:
a. Construct the Residual Graphb. Find a path from the source to the sink with strictly
positive flow.c. If this path exists, update flow to include it. Go to
Step a.d. Else, the flow is maximal.e. The (s,t)-cut has as S all vertices reachable from the
source, and T as V - S.
![Page 18: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/18.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
6
3
2
34
114
4
11
19
46
8
51
8
2
![Page 19: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/19.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
6
3
23
411
4
4
11
19
46
8
51
8
2
Total: 2
10 1515
1510
6
3
2
34
114
4
11
19
46
8
51
8
2
![Page 20: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/20.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
8
1
54
114
2
11
19
28
8
51
8
22
![Page 21: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/21.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
8
1
5
411
4
2
11
19
28
8
51
8
22
Total: 1
10 1515
1510
8
1
54
114
2
11
19
28
8
51
8
22
![Page 22: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/22.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
9
53
124
1
12
18
19
8
42
8
23
![Page 23: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/23.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
9
53
124
1
12
18
19
8
42
8
23
10 1515
1510
9
5
312
4
1
12
18
19
8
42
8
23
Total: 1
![Page 24: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/24.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
6
3
23
411
4
4
11
19
46
8
51
8
2
10 1515
1510
8
1
5
411
4
2
11
19
28
8
51
8
22
10 1515
1510
9
5
312
4
1
12
18
19
8
42
8
23
Total: 2 Total: 1
Total: 1
10 1514
1510
9
52
134
13
19
8
33
9
1
4
17
1
![Page 25: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/25.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1515
1510
6
3
23
411
4
4
11
19
46
8
51
8
2
10 1515
1510
8
1
5
411
4
2
11
19
28
8
51
8
22
10 1515
1510
9
5
312
4
1
12
18
19
8
42
8
23
Total: 2 Total: 1
Total: 1
10 1514
1510
9
52
134
13
19
8
33
9
1
4
17
1
![Page 26: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/26.jpg)
Ford-Fulkerson AlgorithmResidual Graphs
10 1514
1510
9
52
134
13
19
8
33
9
1
4
17
1
Max Flow Min Cut
![Page 27: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/27.jpg)
1. Basic Background
2. Cuts
3. Flows
4. The Max-Flow, Min-Cut Theorem
5. Conclusion
Agenda
![Page 28: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/28.jpg)
Conclusion
Widely used in computer science.
![Page 29: Theorem in Graph Theory History and Concepts Behind the ...The Max-Flow, Min-Cut Theorem1 Theorem: For any network, the value of the maximum flow is equal to the capacity of the minimum](https://reader033.vdocuments.us/reader033/viewer/2022052320/5f0d8ade7e708231d43ae099/html5/thumbnails/29.jpg)
Bibliography"On the history of combinatorial optimization (till 1960)" by Alexander Schrijver
- http://homepages.cwi.nl/~lex/files/histco.pdf
Cut and Flow Examples - http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf
Flow Network Image - http://stochastix.wordpress.com/2009/07/28/