A directed edge capacity is the upper bound on the feasible nonnegative flow through that edge. In a residual network, its forward residual capacity is and its backward residual capacity is . Increasing every edge capacity need not increase the maximum flow by that same amount, because a cut of a flow network can contain several edges.

Ancestors (6)

  1. Flow network
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.