About this document
Maximum Flow Problem in Networks by Kris Tine is a document available to read on EtoBox.
The document describes the maximum flow problem and the augmenting path algorithm for finding the maximum flow in a network. The maximum flow problem involves finding the most flow that can be sent from a source node to a sink node in a graph given the capacities of the edges. The augmenting path algorithm works by finding paths from the source to the sink with available residual capacity, sending flow along these paths, and updating the residual capacities until no more augmenting paths exist.
- Author
- Kris Tine
- Language
- EN