![Page 1: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/1.jpg)
A MAXIMUM FLOW MIN CUT THEOREM FOR OPTIMIZING NETWORK
Shethwala Ridhvesh
![Page 2: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/2.jpg)
OUTLINESIntroductionMax flow theoremFord-Fulkerson algorithmMin cut theoremConclusionReferences
![Page 3: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/3.jpg)
![Page 4: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/4.jpg)
MAX FLOW THEOREM-> 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.
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 5: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/5.jpg)
FORD-FULKERSON MAX FLOWThe 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 6: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/6.jpg)
FORD-FULKERSON MAX FLOW
4
11
2
21
2
3
3
1
s
2
4
5
3
t
This is the original network, and the original residual network.
![Page 7: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/7.jpg)
4
11
2
21
2
3
3
1
FORD-FULKERSON MAX FLOW
Find any s-t path in G(x)
s
2
4
5
3
t
![Page 8: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/8.jpg)
4
1
1
2
13
FORD-FULKERSON MAX FLOW
11
1
21
2
3
2
1
s
2
4
5
3
t
![Page 9: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/9.jpg)
4
1
1
2
13
FORD-FULKERSON MAX FLOW
Find any s-t path
11
1
21
2
3
2
1
s
2
4
5
3
t
![Page 10: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/10.jpg)
4
2
1
11
1 2
21
1
1
13
FORD-FULKERSON MAX FLOW
11
1
1
3
2
1
s
2
4
5
3
t
![Page 11: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/11.jpg)
4
2
1
11
1 2
21
1
1
13
FORD-FULKERSON MAX FLOW
11
1
1
3
2
1
s
2
4
5
3
t
Find any s-t path
![Page 12: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/12.jpg)
11 111
4
1
21
12
11
3
FORD-FULKERSON MAX FLOW
113
2
1
s
2
4
5
3
t
![Page 13: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/13.jpg)
11 111
4
1
21
1
22
11
3
FORD-FULKERSON MAX FLOW
113
2
1
s
2
4
5
3
t
Find any s-t path
![Page 14: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/14.jpg)
1
112 1 1
11
4
2
21
1
22
1
FORD-FULKERSON MAX FLOW
113
1
1
s
2
4
5
3
t
2
![Page 15: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/15.jpg)
112 1 1
11
4
2
21
1
22
1
FORD-FULKERSON MAX FLOW
113
1
1
s
2
4
5
3
t
Find any s-t path
2
![Page 16: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/16.jpg)
111
11
4
13
112 1 1
3
2
21
21
FORD-FULKERSON MAX FLOW
2
1s
2
4
5
3
t
2
![Page 17: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/17.jpg)
111
11
4
13
112 1 1
3
2
21
21
FORD-FULKERSON MAX FLOW
2
1s
2
4
5
3
t
2
There is no s-t path in the residual network. This flow is optimal
![Page 18: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/18.jpg)
111
11
4
13
112 1 1
3
2
21
21
FORD-FULKERSON MAX FLOW
2
1s
2
4
5
3
t
2
These are the nodes that are reachable from node s.
s
2
4
5
3
![Page 19: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/19.jpg)
FORD-FULKERSON MAX FLOW
1
1
2
2
2
1
2s
2
4
5
3
t
Here is the optimal flow
![Page 20: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/20.jpg)
MIN CUT 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 21: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/21.jpg)
MIN CUT
![Page 22: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/22.jpg)
MIN CUT
Max flow in network
![Page 23: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/23.jpg)
MIN CUT
![Page 24: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/24.jpg)
APPLICATIONS - Traffic problem on road
- Data Mining- Distributed Computing- Image processing- Project selection- Bipartite Matching
![Page 25: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/25.jpg)
CONCLUSION Using this Max-flow min-cut theorem we can
maximize the flow in network and can use the maximum capacity of route for optimizing network.
![Page 26: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/26.jpg)
REFERENCES Ford, Jr., L. R., and D. R. Fulkerson. “Maximal Flow
Through a Network.” Canadian Journal of Mathematics 8 (1956): 399-404. Canadian Mathematical Society. Web. 2 June,2010
Ellis L. Johnson, Committee Chair, George L. Nemhauser: Shortest paths and multicommoditynetwork flow,2003
FORD.L.R. AND D. R. FULKERSON 1956. Maximal Flow Through a Network. Can. J. Math. 8,399-404.
Cormen, Thomas H. Introduction to Algorithms. 2nd ed. Cambridge, Massachusetts: MIT, 2001
![Page 27: A Maximum Flow Min cut theorem for Optimizing Network](https://reader036.vdocument.in/reader036/viewer/2022062400/587b6f8e1a28abc62f8b5391/html5/thumbnails/27.jpg)
THANK YOU…!!!