OurBigBook About$ Donate
 Sign in Sign up

Residual maximum flow is the remaining optimality gap (fres∗​=f∗−f)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Flow network Max-flow min-cut theorem Residual network
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For an undirected capacitated network, write the net edge flow as yij​=−yji​, and the directed residual capacity as cij​−yij​. On every source–sink cut, residual capacity is the original cut capacity minus the current net flow value f. Taking the minimum over cuts and applying the max-flow min-cut theorem to each network gives the displayed remaining-flow identity.

 Ancestors (8)

  1. Residual network
  2. Max-flow min-cut theorem
  3. Flow network
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 40 / 5 / 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