A network with an example of maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, maximum flow problems involve finding a vertex cover problem pdf flow through a single-source, single-sink flow network that is maximum.
The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum flow problem was first formulated in 1954 by T.
Ross as a simplified model of Soviet railway traffic flow. The electrical flow algorithm of Christiano, Kelner, Madry, and Spielman finds an approximately optimal maximum flow but only works in undirected graphs. A flow network, with source s and sink t. The numbers next to the edge are the capacities.