OurBigBook About$ Donate
 Sign in Sign up

Flow network edge capacity (cij​)

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Graph theory Flow network
2026-10-05  0 By others on same topic  0 Discussions Create my own version
A directed edge capacity is the upper bound cij​≥0 on the feasible nonnegative flow through that edge. In a residual network, its forward residual capacity is cij​−fij​ and its backward residual capacity is fij​. 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

 Incoming links (2)

  • Maximum flow problem
  • Past exam of the mathematics course of the University of Cambridge / 2017 / ib / Paper 4 / 20H / a / Solution

 View article source

 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.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook