Max-Flow-Min-Cut Theorem
May 30, 2021·
·
0 min read
Jan Jakob
Image credit: UnsplashAbstract
The max-flow-min-cut theorem states that in a flow network, the maximum amount of flow that can be sent from a source to a sink is equal to the total weight of the edges in the minimum cut separating the source from the sink. This fundamental theorem is crucial in network flow optimization problems.
Date
May 30, 2021 2:00 PM
Event
Seminar about combinatorial optimization
Location
Heidelberg University
