Maximum flow problems involve finding the maximum possible flow rate through a flow network. It is a special case of network flow problems, such as the circulation problem. The max-flow min-cut theorem states that the maximum value of an s-t flow is equal to the minimum capacity of an s-t cut in the network.

Princeton University

Spring 2023

This course surveys crucial algorithms and data structures used in modern computing, with emphasis on sorting, searching, graphs, and strings. It aims to develop implementations, understand their performance, and evaluate their effectiveness.

No concepts data

+ 25 more concepts