Ford Fulkerson Algorithm: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5610:56, 10 October 2022‎ Admin talk contribs‎ 1,446 bytes +1,446‎ Created page with "== Algorithm Details == Year : 1956 Family : Maximum Flow Authors : Edsger W. Dijkstra Paper Link : http://www-m3.ma.tum.de/foswiki/pub/MN0506/WebHome/dijkstra.pdf Time Complexity : == Problem Statement == In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circula..."
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Ford_Fulkerson_Algorithm"