Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Max-flow min-cut theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Cederbaum's maximum flow theorem=== {{See also| Cederbaum's maximum flow theorem}} The maximum flow problem can be formulated as the maximization of the electrical current through a network composed of nonlinear resistive elements.<ref>{{cite journal|last1=Cederbaum|first1=I.|title=On the optimal operation of communication nets|journal=Journal of the Franklin Institute|date=August 1962|volume=274|issue=2 |pages=130β141|doi=10.1016/0016-0032(62)90401-5 }}</ref> In this formulation, the limit of the current {{math| ''I''<sub>in</sub> }} between the input terminals of the electrical network as the input voltage {{math|''V''<sub>in</sub>}} approaches <math>\infty</math>, is equal to the weight of the minimum-weight cut set. :<math>\lim_{V_{\text{in}} \to \infty} (I_{in})= \min_{X_C}\sum_{(u,v) \in X_C}c_{uv} </math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)