Discover published sets by community

A pivot-based method, much like the simplex method in linear programming, but for solving minimum-cost flow problems on networks.

A constraint that limits the amount of flow that can enter or leave any given vertex in a network, as opposed to just the edges.

A concept in network flow that represents the possibilities for additional flow in the network, where edges carry the residual capacities.

The total amount of flow that leaves the source node (or equivalently enters the sink node) in a network flow problem.

An algorithm for computing maximum flow in a network graph by repeatedly finding blocking flows in a level graph, has a time complexity of $O(V^2E)$.

An implementation of the Ford-Fulkerson method that uses the shortest augmenting paths, leading to a time complexity of $O(VE^2)$ for $V$ vertices and $E$ edges.

A problem of finding the maximum feasible flow that can be sent through a network from a source to a sink node while respecting capacities of all edges.

A principle stating that the sum of flow into a node should equal the sum of flow out of the node, for every node except the source and sink.

A problem to determine the smallest set of edges that, if removed, would disconnect the source node from the sink, thus minimizing the total flow possible.